#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <time.h>
#pragma warning(disable:4996) 

#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif

void solve()
{
    int n, Q;
    scanf("%d%d", &n, &Q);
    vector<ll> a(n), b(n);
    int i;
    for (i = 0; i < n; i++) {
        scanf("%lld", &a[i]);
    }
    for (i = 0; i < Q; i++) {
        int tmp;
        scanf("%d", &tmp);
        tmp = (n - tmp) % n;
        b[tmp]++;
    }
    vector<ll> c = convolution(a, b);

    for (i = n; i <= n*2-2; i++) {
        c[i%n] += c[i];
    }
    for (i = 0; i < n; i++) {
        printf("%lld", c[i]);
        if (i < n - 1) printf(" ");
        else printf("\n");
    }
    return;
}

int main()
{
#if 1
    solve();
#else
    int T;
    scanf("%d", &T);
    int t;
    for (t = 0; t < T; t++) {
        //printf("Case #%d: ", t + 1);
        solve();
    }
#endif
    return 0;
}