#include <bits/stdc++.h>

using namespace std;
using ll = long long;

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

    int n, b;
    cin >> n >> b;

    vector<int> a(n);
    vector<ll> suf(n + 1);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        if (a[i] == 0) {
            suf[i] += (i + 1);
        }
    }
    for (int i = n - 1; i >= 0; --i) {
        suf[i] += suf[i + 1];
    }

    vector<ll> ans(n);
    for (int i = 0; i < n; ++i) {
        ans[i] += b * suf[i];
    }
    const int nb = 1 << b;
    vector stk(nb, unordered_set<int>{});
    vector<int> value(n * b), timer(n * b);
    int l = b / 3, r = b - l;
    int nl = (1 << l), nr = (1 << r);

    auto insert = [&](int id, int mod) {
        int x = value[id];
        int lx = x & (nl - 1);
        int ix = lx;
        int rx = x >> l << l;
        while (true) {
            if (mod == 1) {
                stk[lx + rx].insert(id);
            } else {
                stk[lx + rx].extract(id);
            }
            if (lx + 1 == nl) {
                break;
            }
            lx = (lx + 1) | ix;
        }
    };

    auto update = [&](int x, int add, int orz) {
        vector<int> now;
        int lx = x & (nl - 1);
        int rx = x >> l;
        int ix = rx;
        while (true) {
            int f = lx + (rx << l);
            now.insert(now.end(), stk[f].begin(), stk[f].end());
            stk[f].clear();
            if (rx == 0) {
                break;
            }
            rx = (rx - 1) & ix;
        }
        for (int i : now) {
            insert(i, -1);
            value[i] |= orz;
            ans[i % n] += add;
            insert(i, 1);
        }
    };

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < b; ++j) {
            value[j * n + i] = 1 << j;
            insert(j * n + i, 1);
        }
        if (a[i] != 0) {
            update(nb - 1 - a[i], i + 1, a[i]);
        }
    }

    for (int i = 0; i < n; ++i) {
        cout << ans[i] << " \n"[i == n - 1];
    }

    return 0;
}