#include <bits/stdc++.h>
#define INF 1000000000000000000
#define N 200005
using namespace std;
typedef long long ll;

int n, Q;
ll x[N], w[N], mx[N], mn[N], ans[N];

int main ()
{
    // freopen("0test.in", "r", stdin);
    // freopen("0test.out", "w", stdout);

    scanf("%d %d", &n, &Q);
    for (int i=1; i<=n; i++) { scanf("%lld", &x[i]); }
    for (int i=1; i<=Q; i++) {
        scanf("%lld", &w[i]); w[i]+=w[i-1];
        mx[i]=max(mx[i-1], w[i]);
        mn[i]=min(mn[i-1], w[i]);
    }

    x[0]=-INF; x[n+1]=INF;

    for (int i=1; i<=n+1; i++) {
        // i-1, i
        if (mx[Q]-mn[Q]<=x[i]-x[i-1]) { ans[i-1]+=mx[Q]; ans[i]-=mn[Q]; continue; }

        int l=1, r=Q, res=Q;
        while (l<=r) {
            int md=(l+r)/2;
            if (mx[md]-mn[md]>x[i]-x[i-1]) { res=md; r=md-1; }
            else { l=md+1; }
        }
        if (mx[res]==mx[res-1]) { ans[i-1]+=mx[res]; ans[i]+=(x[i]-x[i-1]-mx[res]); }
        else { ans[i-1]+=(x[i]-x[i-1]+mn[res]); ans[i]-=mn[res]; }
    }

    for (int i=1; i<=n; i++) { printf("%lld\n", ans[i]); }

    return 0;
}