#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,g,n) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

static constexpr ll inf = 1000000000000000000;

int main() {
  int k; ll n;
  cin >> k >> n;
  ll s = 0;
  vector<int> d(k);
  rep(i,0,k) cin >> d[i], s += d[i];
  ll l = 0;
  rep(i,0,k) {
    ll r = l+d[i];
    ll x = dup(r, n);
    ll ans = inf;
    if (x*n+(k-i-1) < s) {
      ans = min(ans, x*n-r+1);
    }
    if (l > 0) {
      ll y = (l-1)/n;
      if (y*n >= i) {
        ans = min(ans, l-y*n);
      }
    }
    if (ans == inf) ans = -1;
    cout << ans << endl;
    l = r;
  }
  return 0;
}