bindi:=proc(n)  if n<1 then [] else [op(bindi(floor(n/2))), n mod 2] fi: end:
idnib:=proc(a) local i:if nops(a)=0 then 0 else a[-1]+2*idnib([seq(a[i],i=1..nops(a)-1)]) fi:end:
oy:=proc(n,m) local S,T,s,t,U,i:
	S:=bindi(n):T:=bindi(m):s:=nops(S):t:=nops(T): if s<t then oy(m,n) else
	U:=[seq(S[i],i=1..s-t),seq((S[s-t+i]+T[i]) mod 2, i=1..t)]:idnib(U):fi:
end:

og:=proc(a,b,c) local d:
print(`Valid winning moves:`):
	d:=oy(b,c): if d < a then print(`take`,a-d,`from first pile`) fi:
	d:=oy(c,a): if d < b then print(`take`,b-d,`from second pile`) fi:
	d:=oy(a,b): if d < c then print(`take`,c-d,`from third pile`) fi:
end: