1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
/*
 *  Copyright (C) 2017  Paweł Widera
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details:
 *  http://www.gnu.org/licenses/gpl.html
 */
#include <unordered_map>
#include <set>
#include <list>
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;


long long int waiting_time(long long int duration, list<long long int>& intervals) {
	long long int delay = 0;
	long long int waiting = 0;

	for (auto iter = intervals.begin(); iter != intervals.end(); ++iter) {
		delay = *iter - duration - delay;
		if (delay < 0) {
			delay = abs(delay);
			waiting += delay;
		} else {
			delay = 0;
		}
	}
	return waiting;
}


int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n, m;
	cin >> n >> m;

	list<long long int> intervals;

	long long int last = 0;
	long long int request_time;
	for (int i = 0; i < n; ++i) {
		cin >> request_time;
		intervals.push_back(request_time - last);
		last = request_time;
	}

	vector<long long int> durations;
	durations.reserve(m);

	int d;
	for (int i = 0; i < m; ++i) {
		cin >> d;
		durations.push_back(d);
	}

	set<int> times(begin(durations), end(durations));
	unordered_map<int, long long int> results;
	results.reserve(times.size());

	for (auto iter = times.rbegin(); iter != times.rend(); ++iter) {
		results[*iter] = waiting_time(*iter, intervals);
	}

	for (auto d: durations) {
		cout << results[d] << endl;
	}

	return 0;
}