mod = 258280327

n = int(input())
f_coeffs = list(map(lambda x: int(x) % mod, input().split()))
m = int(input())
g_coeffs = list(map(lambda x: int(x) % mod, input().split()))

len_f = n + 1
len_g = m + 1

max_degree = n + m
result = [0] * (max_degree + 1)

for i in range(len_f):
    a = f_coeffs[i]
    for j in range(len_g):
        k = i + j
        result[k] = (result[k] + a * g_coeffs[j]) % mod

# Determine the highest non-zero coefficient
degree = max_degree
while degree >= 0 and result[degree] == 0:
    degree -= 1

if degree == -1:
    print(0)
    print(0)
else:
    print(degree)
    print(' '.join(map(str, result[:degree+1])))