N, F = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

cur = 1
sum_min = 0
sum_max = 0
for i in range(N):
    sum_min += min(A[i], B[i], C[i])
    sum_max += max(A[i], B[i], C[i])
    if i < 5000:
        cur = cur << A[i] | cur << B[i] | cur << C[i]
        print(cur.bit_count())
    else:
        print(sum_max - sum_min + 1)