#include <iostream>

using namespace std;

using int64 = long long;
constexpr auto TIMES_MAX = 200000;
int64 times[TIMES_MAX];
int64 D[TIMES_MAX];

int64 N,M;

int64 solution(int64 n, int64 d)
{
    int64 p = 0;
    int64 v = 0;

    for (int64 i = 0;i<n;i++){
        if (p + d > times[i]){
            v = v + p+d - times[i];
            p = p+d;
        }
        else {
            p = times[i];
        }
    }


    return v;
}

int main()
{
    scanf("%lld",&N);
    scanf("%lld",&M);


    for (int n=0;n<N;n++){
        int64 t;
        scanf("%lld", &t);

        times[n] = t;
    }

    for (int m=0;m<M;m++){
        int64 d;
        scanf("%lld", &d);

        D[m] = d;
    }
    for (int m=0;m<M;m++){
        cout << solution(N,D[m]) << endl;
    }
    return 0;
}