def Int.udivmod.go
import bend-kit-int@0.2.0.0/int.bend as Intimport Base
121def Int.udivmod.go(m: Nat, a: Word(m), +n: Nat, +b: Word(n)) ->
122 Word(m) & Word(n):
123 match m a:
124 case 0n WNil{}:
125 (WNil{}, Word.zero(n))
126 case 1n+p WCon{a0, hi}:
127 Int.udivmod.rec(p, a0, n, b, Int.udivmod.go(p, hi, n, b))