MI=lambda:map(int,input().split())
n,k=MI()
d=n-1
h=[1]
while h[-1]<k and len(h)-1<d:
    h.append(min(k,4*h[-1]+3))
d=len(h)-1
def g(d,k):
    for c in"yuusaan":
        t=h[d]if c in"ua"else 1
        if k>t:k-=t
        else:return g(d-1,k)if d and c in"ua"else c
print(g(d,k))