#include <cstdio>
#include <algorithm>

static const int N = (int)3e5;

int n, s;
int a[N];
int p[N];
long long sum;

bool comp(const int &x, const int &y) {
    return a[x] < a[y];
}

int main() {
    freopen("input.txt", "rt", stdin);
    freopen("output.txt", "wt", stdout);

    scanf("%d%d", &n, &s);

    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
        p[i] = i, sum += a[i];
    }

    std::sort(p, p + n, comp);

    for (int i = 0; i < n; i++) {
        int m = (sum + n - i - 1) / (n - i);

        if (a[p[i]] + s >= m) {
            for (int j = i; j < n; j++)
                a[p[j]] = m;

            break;
        }

        sum -= a[p[i]], a[p[i]] = a[p[i]] + s;
    }

    for (int i = 0; i < n; i++)
        printf("%d ", a[i]);

    return 0;
}