#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int k; cin >> k;
	long long n; cin >> n;
	vector<long long>d(k), sd(k + 1);
	rep(i, k)cin >> d[i];
	rep(i, k)sd[i + 1] = sd[i] + d[i];
	rep(i, k) {
		auto l = sd[i], r = sd[i + 1] - 1;
		long long mn = ((l + n - 1) / n) * n - n;
		long long mx = (r / n) * n + n;
		long long ans = LINF;
		//cout << mn << "_" << l << "_" << r << " " << mx << endl;
		if (0 <= mn) {
			auto d = l - mn;
			auto lim = sd[i] - i;
			if (d <= lim)chmin(ans, d);
		}
		if (mx < sd[k]) {
			auto d = mx - sd[i + 1] + 1;
			auto lim = sd[k] - sd[i + 1] - (n - 1 - i);
			//cout << lim << "?" << d << endl;
			if (d <= lim)chmin(ans, d);
		}
		if (ans == LINF)ans = -1;
		cout << ans << endl;
	}
	return 0;
}