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
#include <iostream>
#include <cstdlib>
#include <array>
#include <algorithm>
#include <vector>
using namespace std;
long long T[200000];
int n,m;
long long test(int k)
{
  long long time = 0;
  long long pen = 0;
  for (int i=0;i<n;i++)
  {
    if (time + k <= T[i])
      time = T[i];
    else
    {
      if (time>=T[i]) pen+=k;
      else
      {
        pen+=time+k-T[i];
      }
      time+=k;
    }
  }
  return pen;
}
int main()
{
  std::ios_base::sync_with_stdio(0);
  cin >> n >> m;
  for (int i=0;i<n;i++)
    cin >> T[i];

  int a;
  for (int i=0;i<m;i++)
  {
    cin >> a;
    cout << test(a) << endl;
  }

}