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
#include <bits/stdc++.h>

using namespace std;
typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> PI; 
typedef pair<LL,LL> PLL;
typedef unsigned long long ULL;

#define IOSWORK ios::sync_with_stdio(0); cin.tie(0)
#define FOR(x, b, e) for(int x = b; x<= (e); x++)
#define FORD(x, b, e) for(int x = b; x>= (e); x--)
#define REP(x, n) for(int x = 0; x<(n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define VAR(v, n) typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)

#define SCAN_INT(n) scanf("%i",&n)
#define SCAN_P_INT(n,m) scanf("%i %i",&n,&m)
#define PRINT_P_INT(n,m) printf("%i %i\n",n,m);
#define PRINT_INT(n) printf("%i\n",n)


#define PB push_back
#define IN insert
#define ST first
#define ND second
#define INF 1000000007


#define MAXSIZE 200100

int n,m;

int piekarniki[MAXSIZE];

LL klienci[MAXSIZE];
LL ostatni_czas[MAXSIZE]={0};
LL wyniki[MAXSIZE]={0};

int main(){
	SCAN_P_INT(n,m);
	
	FOR(i,1,n)
		scanf("%lld",&klienci[i]);
	
	FOR(i,1,m)
		SCAN_INT(piekarniki[i]);
	
	FOR(i,1,n){	//petla po klientach
		FOR(j,1,m){	//petla po piekarnikach
			if(ostatni_czas[j]+piekarniki[j]<=klienci[i]){
				ostatni_czas[j]=klienci[i];
			}
			else{
				wyniki[j]+=ostatni_czas[j]+piekarniki[j]-klienci[i];
				ostatni_czas[j]+=piekarniki[j];
			}
		}
	}
	
	FOR(j,1,m)
		printf("%lld\n",wyniki[j]);
   return 0;
}