#include <bits/extc++.h>

using namespace std;

constexpr int maxb = 20;

int pos[1 << maxb];

int vl1[1 << maxb], vl2[1 << maxb];

void solve() {
    int n, b;
    cin >> n >> b;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    int part1 = 19;
    if (part1 > b) {
        part1 = b;
    }
    for (int i = 0; i < (1 << b); ++i) {
        pos[i] = n;
        vl1[i] = (((i ^ ((1 << b) - 1)) >> (b - part1)) << (b - part1));
        vl2[i] = (i ^ ((1 << b) - 1)) - vl1[i];
    }
    vector<long long> ans(n);
    long long sum_zero = 0;
    for (int i = n - 1; i >= 0; --i) {
        if (a[i] != 0) {
            int val1 = (a[i] >> (b - part1)), val2 = (a[i] & ((1 << (b - part1)) - 1));
            for (int j = 0; j < (1 << part1); ++j) {
                if ((val1 & j) == val1) {
                    pos[(j << (b - part1)) + val2] = i;
                }
            }
        } else {
            sum_zero += i + 1;
        }

        ans[i] = sum_zero * b;
        for (int st = 0; st < b; ++st) {
            int val_nw = (1 << st);
            while (true) {
                int nxt = n;
                int val1 = vl1[val_nw], val2 = vl2[val_nw];
                for (int j = 0; j < (1 << (b - part1)); ++j) {
                    if ((val2 | j) == val2) {
                        nxt = min(nxt, pos[val1 + j]);
                    }
                }
                if (nxt == n) {
                    break;
                }
                val_nw |= a[nxt];
                ans[i] += nxt + 1;
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        cout << ans[i] << ' ';
    }
    cout << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}