import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

def update_ai_by_aj(i,j):
    res = ["UPD {} {}".format(i,1),"AND {} {} {}".format(i,i,j)]
    return res

def update_by_bool(b,i,j):
    """
    ・b:Trueならaiをajでupdate
    ・b,jは破壊してok
    ・a_i←a_i(1-b)+a_j=a_i^(a_i&b)^(a_j&b)
    """
    res = []
    res.append("AND {} {} {}".format(j,b,j))
    res.append("AND {} {} {}".format(b,b,i))
    res.append("XOR {} {} {}".format(i,i,j))
    res.append("XOR {} {} {}".format(i,i,b))
    return res

N,K = mi()

res = []

"""
加算 XORで桁 ANDで繰り上がり
2個の処理以外はAND_regiに繰り上がりをメモ
"""
res.append("AND {} {} {}".format(N,0,1))
res.append("XOR {} {} {}".format(0,0,1))
res += update_ai_by_aj(1,N)
res.append("UPD {} {}".format(N,0))

up_memo = N
AND_regi = 2
for b in range(2,N):
    if b+1 == 1<<AND_regi:
        AND_regi += 1

    res.append("AND {} {} {}".format(up_memo,0,b))
    res.append("XOR {} {} {}".format(0,0,b))
    for i in range(1,AND_regi):
        res.append("AND {} {} {}".format(AND_regi,up_memo,i))
        res.append("XOR {} {} {}".format(i,up_memo,i))
        res += update_ai_by_aj(up_memo,AND_regi)

"""
初期化
"""
res.append("UPD {} {}".format(AND_regi,0))
res.append("UPD {} {}".format(N,0))

if N==2:
    if K==1:
        res.append("XOR {} {} {}".format(2,0,1))
    else:
        res += update_ai_by_aj(2,1)
else:
    assert AND_regi!=N
    """
    下の桁から比較
    AND_regiに両方の整数のi桁目のXORを記録
    XOR=0なら更新しない
    XOR=1ならaiで更新
    """
    for i in range(AND_regi):
        res.append("UPD {} {}".format(AND_regi,(K-1)>>i & 1))
        res.append("XOR {} {} {}".format(AND_regi,i,AND_regi))
        res += update_by_bool(AND_regi,N,i)
        res.append("UPD {} {}".format(AND_regi,0))

print(len(res))
print(*res,sep="\n")