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

#define int long long  

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

	int n, m;
	cin >> n >> m;

	vector<int> a(n + 1);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}

	vector<int> p(n + 1);
	iota(p.begin(), p.end(), 0);
	sort(p.begin() + 1, p.end(), [&](int i, int j) {
		return a[i] == a[j] ? i < j : a[i] < a[j];
	});

	vector<int> ans(n + 1);
	int sum = 0;
	for (int i = 1; i <= n; i++) {
		sum += a[p[i]];
		ans[p[i]] = i * a[p[i]] - sum + i - 1;
		if (i != 1) {
			if ((a[p[i]] - a[p[i - 1]]) % 2 == 0 && a[p[i]] - a[p[i - 1]] != 0) {
				ans[p[i]]--;
			}
		}	
	}

	for (int i = 1; i <= n; i++) {
		cout << (ans[i] <= m - 2 ? ans[i] : -1LL) << "\n";
	}

    return 0;
}