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
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
#include<bits/stdc++.h>
#define ALL(X)        X.begin(),X.end()
#define FOR(I,A,B)    for(int (I) = (A); (I) <= (B); (I)++)
#define FORW(I,A,B)   for(int (I) = (A); (I) < (B);  (I)++)
#define FORD(I,A,B)   for(int (I) = (A); (I) >= (B); (I)--)
#define CLEAR(X)      memset(X,0,sizeof(X))
#define SIZE(X)       int(X.size())
#define CONTAINS(A,X) (A.find(X) != A.end())
#define PB            push_back
#define MP            make_pair
#define X             first
#define Y             second
using namespace std;
template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U> &_p) { return os << "(" << _p.X << "," << _p.Y << ")"; }
template<typename T> ostream& operator << (ostream &os, const vector<T>& _V) { bool f = true; os << "["; for(auto v: _V) { os << (f ? "" : ",") << v; f = false; } return os << "]"; }
template<typename T> ostream& operator << (ostream &os, const set<T>& _S) { bool f = true; os << "("; for(auto s: _S) { os << (f ? "" : ",") << s; f = false; } return os << ")"; }
template<typename T, typename U> ostream& operator << (ostream &os, const map<T, U>& _M) { return os << set<pair<T, U>>(ALL(_M)); }
typedef signed long long slong;
typedef long double ldouble;
typedef pair<int,int> pii;
const slong INF = 1000000100;
const ldouble EPS = 1e-9;

template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";}
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...);
}

#ifdef LOCALs
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

const int MAXT = 1000042;
slong ans[MAXT+42];

typedef pair<slong,slong> pll;
typedef pair<slong,pll> event;

map<slong,slong> zap; /// <start(koniec pierwszego?), liczba zapieksow(lacznie z pierwszym)>
map<int,pll> groups; /// <rozmiar, <liczba grup, suma poczatkow> >
set<event> S;

inline void add_event(slong st, slong cnt, slong st2, slong cnt2) {
    /// TODO: napisac
    slong d = (st2 - st + cnt - 1) / cnt;
    event e = {d, {st, st2}};
    S.insert(e);
    //cerr << "dodany event ";
    //debug(e);
}

void add_group(slong st, slong cnt) {
    //cerr << "dodaj ";
    //debug(st, cnt);
    zap[st] = cnt;
    groups[cnt].X++;
    groups[cnt].Y += st;
    /// TODO: generowanie eventow <- patrz add_event
    auto it = zap.find(st);
    if(it != zap.begin()) {
        it--;
        add_event(it->X, it->Y, st, cnt);
        it++;
    }

    it++;
    if(it != zap.end()) {
        add_event(st, cnt, it->X, it->Y);
    }
}

inline void rem_group(slong st, slong cnt) {
    //cerr << "zabierz ";
    //debug(st, cnt);
    zap.erase(st);
    groups[cnt].X--;
    groups[cnt].Y -= st;
    if(groups[cnt].X == 0) groups.erase(cnt);
}

inline slong foo(slong d, slong sz) {
    /// suma koncow sz zapieksow o dlugosci d zaczynajac od 0
    return d * sz * (sz + 1) / 2;
}

void calc(slong d) { /// d - dlugosc zapieksa
    for(auto g : groups) {
        slong sz = g.X;
        slong cnt = g.Y.X;
        slong sumst = g.Y.Y;
        ans[d] += sz * sumst;
        ans[d] += cnt * foo(d, sz-1);
    }
}

void try_merge(slong x, slong y, slong d) {
    /// pierwsze grupki startujace >= x i >= y moga chciec sie zlaczyc
    /// >= x bo pierwsza moze sie przesuwac bo syf
    /// mogly sie tez juz zmergowac i nie istniec itp

    /// TODO: napisac
    //cerr << "try_merge ";
    //debug(x, y, d);
    auto a = zap.lower_bound(x), b = zap.lower_bound(y);
    if(a == zap.end() || b == zap.end()) return;
    slong st = a->X, cnt = a->Y;
    slong st2 = b->X, cnt2 = b->Y;
    if(MP(st,cnt) == MP(st2,cnt2)) return;

    if(st + cnt * d >= st2) {
        //cerr << "  >> zmergowano!\n";
        rem_group(st, cnt);
        rem_group(st2, cnt2);
        add_group(st, cnt + cnt2);
    }
}

void fix_first_group(slong d) {
    /// TODO: napisac przesuwanie pierwszej grupki o 1 gdy potrzeba
    if(!SIZE(zap)) return;
    slong st = zap.begin()->X, cnt = zap.begin()->Y;
    if(st < d) {
        rem_group(st, cnt);
        add_group(d, cnt);
        //cerr << "przesunalem pierwsza grupke ";
        //debug(st, cnt, d);
    }
}

void solve()
{
    int n, m;
    cin >> n >> m;
    /*if(n > 1000) {
        cout << "DUZO\n";
        return;
    }*/
    vector<slong> T(n), D(m);
    slong client_sum = 0;
    FORW(i,0,n) {
        cin >> T[i];
        client_sum += T[i];
    }
    slong maksd = 0;
    FORW(i,0,m) {
        cin >> D[i];
        ans[D[i]] = 1;
        maksd = max(maksd, D[i]);
    }

    //zap[-INF] = 0;
    //zap[INF*100000] = 0;

    FOR(d,1,maksd) {
        //debug("---\n", d);
        if(d == 1) {
            /// poczatkowe grupki dla d = 1
            pll z = {-1, 0};
            slong prev = 0;
            for(slong t : T) {
                if(t - d <= prev) {
                    prev += d;
                    z.Y++;
                    if(z.X < 0) z.X = d;
                }
                else {
                    if(z.Y > 0) add_group(z.X, z.Y);
                    prev = t;
                    z = {t, 1};
                }
            }
            if(z.Y > 0) add_group(z.X, z.Y);
        }
        else {
            fix_first_group(d);
            while(SIZE(S) && S.begin()->X <= d) {
                pll pp = S.begin()->Y;
                S.erase(S.begin());
                try_merge(pp.X, pp.Y, d);
            }
        }

        if(ans[d]) {
            ans[d] = 0;
            calc(d);
        }

        /*auto old_z = zap;
        for(pll g : old_z) {
            if(g.Y > 0) rem_group(g.X, g.Y);
        }*/
    }

    for(int d : D) {
        cout << ans[d] - client_sum << "\n";
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    solve();
}