#include <iostream>
#include <vector>
#include <algorithm>

typedef long long ll;
using namespace std;
std::vector<ll> times;

ll solve(ll m)
{
	ll prev_end_time = std::max(times.front(), m);
	ll solution = std::max(0ll, m - times.front());
	for (int i = 1; i < times.size(); ++i)
	{
		solution += std::max(0ll, prev_end_time - times[i] + m);
		prev_end_time = std::max(times[i], prev_end_time + m);
	}

	return solution;
}

int main()
{
	ios::sync_with_stdio(false);
	int n, m;
	ll piekarnik;
	cin >> n >> m;
	times.resize(n);

	for(int i = 0; i < n; ++i)
	{
		cin >> times[i];
	}
	for (int i = 0; i < m; ++i)
	{
		cin >> piekarnik;
		cout << solve(piekarnik) << endl;
	}
	return 0;
}