#include <iostream>
#include <queue>
#include <assert.h>

using namespace std;


long max(long a, long b) {
	if (a > b) return a; else return b;
}


int main() {
	long n, m;
	cin >> n >> m;
	long t[n];   for (long i = 0; i<n; i++) cin >> t[i];
	long d[m];   for (long i = 0; i<m; i++) cin >> d[i];

	for (long j=0; j<m; j++) {
		long dd  = d[j];
		long pos = 0;
		long ret = 0;
		for (long i=0; i<n; i++) {
			if (pos + dd > t[i])
				ret += (pos + dd - t[i]);
			pos = max(pos+dd, t[i]);
		}
		cout << ret << endl;
	}
	return 0;
}