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
#include <iostream>

using namespace std;
typedef long long ll;

ll endtime;
ll t[220000];
ll m;
ll n;

ll timeNeeded(ll d, ll i)
{
    ll ti = t[i];
    //ll n = 1;
    
    if (endtime + d > ti)
    {
        /*
        cout << t[i] << " needs1 " << n*(endtime + d - ti) + (n*d*(n-1))/2 << endl;
        ll ret = n*(endtime + d - ti) + (n*d*(n-1))/2;
        endtime += n*d;
        */
        ll ret = (endtime + d - ti);
        endtime += d;
        return ret;
    }
    else
    {
        
        /*
        cout << t[i] << " needs2 " << (n*d*(n-1))/2 << endl;
        ll ret = (n*d*(n-1))/2;
        endtime = ti + (n-1)*d;
        */
        ll ret = 0;
        endtime = ti;
        return ret;
    }
    
}

int main()
{
    ios_base::sync_with_stdio(false);


    cin >> n >> m;

    for (int i = 0; i < n; i++)
    {
        cin >> t[i];
    }

    
    for (int x = 0; x < m; x++)
    {
        ll d = 0;
        ll sum = 0;
        endtime = 0;

        cin >> d;
        for (int i = 0; i < n; i++)
        {
            sum += timeNeeded(d,i);
            
        }

        cout << sum << endl;
    }



    return 0;
}