#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
uint32_t ins = 0, qry = 0;

vector<uint32_t> rev;

template<int type>
struct Jump {
    int n1, n2;
    vector<int> jump;
    Jump(int n1, int n2) : n1(n1), n2(n2), jump(1<<(n1+n2), 1<<30) {}
    void insert(uint32_t msk, int val) {
        if(!type) msk = rev[msk];
        uint32_t A, B;
        A = msk & ((1<<n1) - 1);
        B = msk - A;
        swap(A, B);
        
        int iter, minBit = 0;
        iter = 1<<(n2 - __builtin_popcount(A));
        minBit = 1<<n1;
        
        uint32_t Asub = A;
        while(iter--) {
            // ins++;
            jump[Asub | B] = val;
            // std::cout << (Asub|B) << " = " << val << endl;
            Asub = (Asub + minBit) | A;
        }
    }
    int get(uint32_t msk) {
        if(!type) msk = rev[msk];
        uint32_t A, B;
        A = msk & ((1<<n1) - 1);
        B = msk - A;
        swap(A, B);
        
        uint32_t Bsub = B;
        int best = 1<<30;
        do {
            // qry++;
            best = min(best, jump[A | Bsub]);
            Bsub = (Bsub - 1) & B;
            // std::cout << (Bsub|A) << " < " << jump[Bsub|A] << endl;
        } while(Bsub != B);
        return best;
    }
};

vector<long long> solve(vector<uint32_t> a, int b) {
    int M = 1<<b;
    
    rev.resize(M);
    for(int i = 0; i < M; i++) {
        for(int j = 0; j < b; j++) {
            rev[i] |= ((i >> j) & 1)<<(b-1-j);
        }
        // cout << i << " " << rev[i] << endl;
    }
    
    
    const int L = b * 0.5;
    Jump<0> Jlow(b - L, L);
    Jump<1> Jhigh(L, b - L);
    
    int low = (1<<L) - 1;
    int high = M - 1 - low;
    
    int n = a.size();
    vector<long long> answers(n);
    vector<int> next(M, n);
    long long zero_sum = 0;
    for(int i = n; i--;) {
        if(a[i]) {
            // next[a[i]] = i;
            Jlow.insert(a[i], i);
            Jhigh.insert(a[i], i);
        } else {
            zero_sum += 1+i;
        }
        
        for(int banned = 0; banned < b; banned++) {
            uint32_t z = 1u<<banned;
            long long cur_ans = 0;
            while(true) {
                uint32_t free_bits = M - 1 - z;
                // int j = Jlow.get(free_bits); 
                int j;
                if(__builtin_popcount(free_bits & low) >=
                    __builtin_popcount(free_bits & high))
                    j = Jlow.get(free_bits);//b - L higher bits used
                else
                    j = Jhigh.get(free_bits);//L lower bits used
                // cout << i << " " << j << " " << z << " " << free_bits << endl;
                if(j >= n) break;
                cur_ans += 1 + j;
                z |= a[j];
            }
            answers[i] += cur_ans + zero_sum;
        }
    }
    cerr << "Ins: " << ins << "; Qry: " << qry << endl;
    return answers;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, b;
    cin >> n >> b;
    vector<uint32_t> a(n);
    for(auto &i : a) cin >> i;
    auto res = solve(a, b);
    for(auto i : res) cout << i << " "; cout << endl;
}