#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
    int k; ll n; cin >> k >> n;
    vector<ll> d(k);
    ll s = 0;
    for (auto& i : d) { cin >> i;  s += i; }
    
    ll l=0, r=0;
    for (int i=0; i<k; i++, l=r) {
        ll ans = numeric_limits<ll>::max();
        ll x = l%n;
        if (x == 0) x = n;
        if (x <= l-i) ans = min(ans, x);
        r = l+d[i];
        ll y = n-(r-1)%n;
        if (y <= s-r-(k-i-1)) ans = min(ans, y);
        
        cout << (ans==numeric_limits<ll>::max() ? -1 : ans) << '\n';
    }
}