from typing import List MOD2 = 469762049 MOD3 = 754974721 sum_e1 = [ 65249968, 137365239, 35921276, 103665800, 89728614, 164955302, 108901219, 163950188, 113252399, 166581688, 59783366, 95476790, 130818126, 39440948, 65800545, 14559656, 3285286, 36462062, 164082627, 9320421, 66343657, 69024390, 38289678, 0, 0, 0, 0, 0, 0, 0, ] sum_ie1 = [ 102522193, 71493608, 26998229, 133555027, 128975965, 16363816, 145463520, 130828795, 26375299, 18078794, 87407453, 28151929, 49401241, 112914531, 118959329, 68815302, 71865958, 21459372, 44393528, 43709352, 30681399, 153195333, 141748999, 0, 0, 0, 0, 0, 0, 0, ] sum_e2 = [ 450151958, 26623616, 25192837, 305390008, 399060560, 78724413, 312251397, 151088193, 437503217, 339869829, 197503427, 460844482, 64795813, 392699793, 323591778, 435162849, 324666788, 397071166, 191521520, 39442863, 102932772, 52822010, 231589706, 155147527, 0, 0, 0, 0, 0, 0, ] sum_ie2 = [ 19610091, 129701348, 104677229, 445839763, 375500824, 451642859, 145445927, 77724141, 367250623, 54456563, 257713867, 444918711, 335270416, 371371281, 307213086, 452878044, 243328637, 152011944, 315423951, 456185089, 218081060, 136058803, 203260256, 412215962, 0, 0, 0, 0, 0, 0, ] sum_e3 = [ 323860177, 709730407, 436702940, 377572811, 498550177, 265767825, 100966039, 179671739, 669698534, 133401683, 473130419, 31725267, 490947959, 457689220, 238049902, 49087920, 531104465, 448493484, 262339740, 717535334, 230862726, 416349974, 0, 0, 0, 0, 0, 0, 0, 0, ] sum_ie3 = [ 431114544, 205430076, 560644912, 287842920, 662221072, 3742006, 250769401, 512611432, 114808946, 480642746, 472385404, 152834416, 131937947, 932118, 246823069, 305783701, 453008707, 746618366, 510123862, 69538303, 659667489, 259138136, 0, 0, 0, 0, 0, 0, 0, 0, ] def butterfly2(arr): n = len(arr) h = (n - 1).bit_length() for ph in range(1, h + 1): w = 1 << (ph - 1) p = 1 << (h - ph) now = 1 for s in range(w): offset = s << (h - ph + 1) for i in range(p): l = arr[i + offset] r = arr[i + offset + p] * now arr[i + offset] = (l + r) % MOD2 arr[i + offset + p] = (l - r) % MOD2 now *= sum_e2[(~s & -~s).bit_length() - 1] now %= MOD2 def butterfly_inv2(arr): n = len(arr) h = (n - 1).bit_length() for ph in range(1, h + 1)[::-1]: w = 1 << (ph - 1) p = 1 << (h - ph) inow = 1 for s in range(w): offset = s << (h - ph + 1) for i in range(p): l = arr[i + offset] r = arr[i + offset + p] arr[i + offset] = (l + r) % MOD2 arr[i + offset + p] = (MOD2 + l - r) * inow % MOD2 inow *= sum_ie2[(~s & -~s).bit_length() - 1] inow %= MOD2 def convolution2(a, b): n = len(a) m = len(b) if not n or not m: return [] if min(n, m) <= 100: if n < m: n, m = m, n a, b = b, a res = [0] * (n + m - 1) for i in range(n): for j in range(m): res[i + j] += a[i] * b[j] res[i + j] %= MOD2 return res z = 1 << (n + m - 2).bit_length() a += [0] * (z - n) b += [0] * (z - m) butterfly2(a) butterfly2(b) for i in range(z): a[i] *= b[i] a[i] %= MOD2 butterfly_inv2(a) a = a[: n + m - 1] iz = pow(z, MOD2 - 2, MOD2) for i in range(n + m - 1): a[i] *= iz a[i] %= MOD2 return a def butterfly3(arr): n = len(arr) h = (n - 1).bit_length() for ph in range(1, h + 1): w = 1 << (ph - 1) p = 1 << (h - ph) now = 1 for s in range(w): offset = s << (h - ph + 1) for i in range(p): l = arr[i + offset] r = arr[i + offset + p] * now arr[i + offset] = (l + r) % MOD3 arr[i + offset + p] = (l - r) % MOD3 now *= sum_e3[(~s & -~s).bit_length() - 1] now %= MOD3 def butterfly_inv3(arr): n = len(arr) h = (n - 1).bit_length() for ph in range(1, h + 1)[::-1]: w = 1 << (ph - 1) p = 1 << (h - ph) inow = 1 for s in range(w): offset = s << (h - ph + 1) for i in range(p): l = arr[i + offset] r = arr[i + offset + p] arr[i + offset] = (l + r) % MOD3 arr[i + offset + p] = (MOD3 + l - r) * inow % MOD3 inow *= sum_ie3[(~s & -~s).bit_length() - 1] inow %= MOD3 def convolution3(a, b): n = len(a) m = len(b) if not n or not m: return [] if min(n, m) <= 100: if n < m: n, m = m, n a, b = b, a res = [0] * (n + m - 1) for i in range(n): for j in range(m): res[i + j] += a[i] * b[j] res[i + j] %= MOD3 return res z = 1 << (n + m - 2).bit_length() a += [0] * (z - n) b += [0] * (z - m) butterfly3(a) butterfly3(b) for i in range(z): a[i] *= b[i] a[i] %= MOD3 butterfly_inv3(a) a = a[: n + m - 1] iz = pow(z, MOD3 - 2, MOD3) for i in range(n + m - 1): a[i] *= iz a[i] %= MOD3 return a def inv_gcd(a, b): a %= b if a == 0: return b, 0 s = b t = a m0 = 0 m1 = 1 while t: u = s // t s -= t * u m0 -= m1 * u s, t = t, s m0, m1 = m1, m0 if m0 < 0: m0 += b // s return s, m0 def crt(r, m): n = len(r) r0 = 0 m0 = 1 for i in range(n): r1 = r[i] % m[i] m1 = m[i] if m0 < m1: r0, r1 = r1, r0 m0, m1 = m1, m0 if m0 % m1 == 0: if r0 % m1 != r1: return 0, 0 continue g, im = inv_gcd(m0, m1) u1 = m1 // g if (r1 - r0) % g: return 0, 0 x = (r1 - r0) // g * im % u1 r0 += x * m0 m0 *= u1 if r0 < 0: r0 += m0 return r0, m0 def convolution(a: List[int], b: List[int], mod: int) -> List[int]: n = len(a) m = len(b) c2 = convolution2(a[:], b[:])[: n + m - 1] c3 = convolution3(a[:], b[:])[: n + m - 1] res = [0] * (n + m - 1) for i, v in enumerate(zip(c2, c3)): cr, _ = crt(v, (MOD2, MOD3)) res[i] = (res[i] + cr) % mod return res def multiConvolution(arrs: List[List[int]], mod: int) -> List[int]: if not arrs: return [] if len(arrs) == 1: return arrs[0] if len(arrs) == 2: return convolution(arrs[0], arrs[1], mod) m = len(arrs) >> 1 return convolution(multiConvolution(arrs[:m], mod), multiConvolution(arrs[m:], mod), mod) import sys from collections import deque, Counter input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) inf = 2 ** 63 - 1 if __name__ == "__main__": MOD = 258280327 n1 = ii() A = li() n2 = ii() B = li() for i in range(n1): A[i] %= MOD for i in range(n2): B[i] %= MOD C = convolution(A, B, MOD) print(len(C) - 1) print(*C)