from math import pi, cos, sin
import sys
input = sys.stdin.readline

class FFT:
    @classmethod
    def convolve(cls, f, g):
        size = len(f) + len(g) - 1
        n = 1
        while n < size:
            n *= 2
        nf = f[:] + [0] * (n - len(f))
        ng = g[:] + [0] * (n - len(g))
        cls.fft(nf)
        cls.fft(ng)
        for i in range(n):
            nf[i] *= ng[i]
        cls.ifft(nf)
        ret = [0] * size
        for i in range(size):
            ret[i] = nf[i].real / n
        return ret

    @classmethod
    def fft(cls, f):
        n = len(f)
        m = n
        while m > 1:
            ang = 2 * pi / m
            omega = complex(cos(ang), sin(ang))
            for s in range(n // m):
                w = 1
                for i in range(m // 2):
                    l = f[s * m + i]
                    r = f[s * m + i + m // 2]
                    f[s * m + i] = l + r
                    f[s * m + i + m // 2] = (l - r) * w
                    w *= omega
            m //= 2

    @classmethod
    def ifft(cls, f):
        n = len(f)
        m = 2
        while m <= n:
            ang = -2 * pi / m
            omega = complex(cos(ang), sin(ang))
            for s in range(n // m):
                w = 1
                for i in range(m // 2):
                    l = f[s * m + i]
                    r = f[s * m + i + m // 2] * w
                    f[s * m + i] = l + r
                    f[s * m + i + m // 2] = l - r
                    w *= omega
            m *= 2

N, Q = map(int, input().split())
a = list(map(int, input().split()))
r = list(map(int, input().split()))
x = [0] * N
for i in r:
    x[-i] += 1
ans = FFT.convolve(a, x)
ans = list(map(round, ans))
for i in range(N, len(ans)):
    ans[i % N] += ans[i]
print(*ans[:N])