# hack しようと思えばいくらでも
def prime(x):
	if x<2:
		return False
	a=2
	while a*a<=x:
		if x%a==0:
			return False
		a+=1
	return True
def my_pow(x):
	INF=(1<<56)
	tmp=1
	while tmp*x<=INF:tmp*=x
	if x!=2: tmp*=tmp
	return tmp
N=0
D=59
K=(1<<D)
Q=1
M=(998244353)*924924167*((2**61)-1)

for j in range(3,10):
	for k in range(1,10):
		X=(10**j)*k
		for i in range(X-1000,X+1000):
			if prime(i):M*=my_pow(i)
A=[0]*0
while M:
	A.append(M&(K-1))
	M>>=D
N=len(A)
print(N,Q,K)
print(*A)
print(1,N)