import sys
from itertools import permutations
from heapq import *
from collections import deque
import random
import bisect
from math import factorial

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

def search(n):
    assert 3 <= n

    def check(A,calc_res):
        for x in range(1):
            for y in range(1):
                t = [x,y]
                check = calc_res[t[A[0]]][t[A[1]]]
                for i in range(2,n):
                    check = calc_res[check][t[A[i]]]
                
                if not check == calc_res[x][y]:
                    return False
        
        return True
    
    
    for T in range(1<<n):
        A = [T>>i & 1 for i in range(n)]
        for S in range(16):
            calc_res = [[S & 1, (S>>1) & 1],[(S>>2) & 1, (S>>3) & 1]]
            if not check(A,calc_res):
                break
        else:
            return A

X,Y = mi()
print(4,flush=True)
print(*[X,X,X,X],flush=True)
t = int(input())
print(t)