def gcd(a, b):
    while b:
        a, b = b, a%b
    return a
    
def mul(a,b):
    return a*b / gcd(a,b)

L =  raw_input()
L = L.split()

for i in range(len(L)):
    L[i]=int(L[i])
    
k = 3    
print k
k = mul(L[0],L[1])
print 1, k*2
print 1, k+1
print 3, k