#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];
    }

    if (n <= 2000 || b <= 20) {
        const int nb = 1 << b;
        vector stk(nb, vector<int>{});
        vector<int> value(n * b), timer(n * b);

        int l = 12, r = b - l;
        int nl = (1 << l), nr = (1 << r);

        auto insert = [&](int id) {
            int x = value[id];
            int lx = x & (nl - 1);
            int ix = lx;
            int rx = x >> l << l;
            timer[id] += 1;
            while (true) {
                stk[lx + rx].push_back(id * 21 + timer[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();
                stk[f].shrink_to_fit();
                if (rx == 0) {
                    break;
                }
                rx = (rx - 1) & ix;
            }
            for (int tt: now) {
                int i = tt / 21;
                int t = tt - i * 21;
                if (timer[i] != t) {
                    continue;
                }
                value[i] |= orz;
                ans[i % n] += add;
                insert(i);
            }
        };

        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < b; ++j) {
                value[j * n + i] = 1 << j;
                insert(j * n + i);
            }
            if (a[i] != 0) {
                update(nb - 1 - a[i], i + 1, a[i]);
            }
        }
    } else {
        vector last(b, vector<int>(n + 1, -1));
        for (int i = n - 1; i >= 0; --i) {
            if (a[i] > 0) {
                last[__lg(a[i])][i] = i;
            }
            for (int j = 0; j < b; ++j) {
                if (last[j][i] == -1) {
                    last[j][i] = last[j][i + 1];
                }
            }
        }
        for (int i = 0; i < n; ++i) {
            for (int s = 0; s < b; ++s) {
                int x = 1 << s;
                int t = i;
                while (x + 1 < (1 << b) && t < n) {
                    pair<int, int> mn{1e9, -1};
                    for (int u = 0; u < b; ++u) {
                        if ((x >> u & 1) == 0 && last[u][t] != -1) {
                            mn = min(mn, pair(last[u][t], u));
                        }
                    }
                    if (mn.first == 1e9) {
                        break;
                    }
                    ans[i] += mn.first + 1;
                    x |= 1 << mn.second;
                    t = mn.first + 1;
                }
            }
        }
    }

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

    return 0;
}