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
#include <stdio.h>

int i=1, n, m;
long long t[200002], sum=0, last, a, wynn;

int main(){
	scanf ("%d %d", &n, &m);
	t[0]=0;
	while (i<=n){
		scanf ("%lld", &t[i]);
		i++;
	}
		
	
	while (m--){
		scanf ("%lld", &a);
		i=1, last=wynn=0;
		while (i<=n){
			if (t[i]-last>=a)	last=t[i];
			else last+=a, wynn=wynn+last-t[i];
			i++;
		}
		printf ("%lld\n", wynn);
	}	
return 0;}