#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007, CB = 6;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
	if (b > a) {
		a = b;
		return true;
	}
	return false;
}

template<typename T>
bool assign_min(T& a, T b) {
	if (b < a) {
		a = b;
		return true;
	}
	return false;
}

template<typename T>
T square(T a) {
	return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
	ll operator() (pair<ll, ll> p) const {
		return ((__int128)p.first * MOD + p.second) % INF64;
	}
};

void solve() {
	ll n, b;
	cin >> n >> b;
	if (b <= CB) {
		vector<ll> last(1 << b, n);
		vector<ll> arr(n);
		for (ll i = 0; i < n; i++) {
			cin >> arr[i];
		}
		vector<ll> ans(n, 0);
		ll mx = (1 << b) - 1;
		ll add = 0;
		for (ll i = n - 1; i >= 0; i--) {
			if (arr[i] != 0) {
				for (ll j = arr[i]; j < (1 << b); j = (j + 1) | arr[i]) {
					last[j] = i;
				}
			} else {
				add += i + 1;
			}
			for (ll j = 0; j < b; j++) {
				ans[i] += add;
				ll now = mx ^ (1 << j);
				while (last[now] != n) {
					ans[i] += last[now] + 1;
					now = now & (mx ^ arr[last[now]]);
				}
			}
		}
		for (auto i : ans) {
			cout << i << ' ';
		}
		cout << '\n';
	} else {
		vector<vector<ll>> last(1 << (b - CB), vector<ll>(1 << CB, n));
		vector<ll> arr(n);
		for (ll i = 0; i < n; i++) {
			cin >> arr[i];
		}
		vector<ll> ans(n, 0);
		ll mx = (1 << b) - 1;
		ll mx2 = (1 << CB) - 1;
		ll add = 0;
		for (ll i = n - 1; i >= 0; i--) {
			if (arr[i] != 0) {
				for (ll j = arr[i] >> CB; j < (1 << (b - CB)); j = (j + 1) | (arr[i] >> CB)) {
					last[j][arr[i] & mx2] = i;
				}
			} else {
				add += i + 1;
			}
			for (ll j = 0; j < b; j++) {
				ans[i] += add;
				ll now = mx ^ (1 << j);
				while (true) {
					ll mi = n;
					for (ll k = now & mx2;; k = (k - 1) & (now & mx2)) {
						mi = min(mi, last[now >> CB][k]);
						if (k == 0) {
							break;
						}
					}
					if (mi == n) {
						break;
					}
					ans[i] += mi + 1;
					now = now & (mx ^ arr[mi]);
				}
			}
		}
		for (auto i : ans) {
			cout << i << ' ';
		}
		cout << '\n';
	}
}

int main() {
	if (IS_FILE) {
		freopen("", "r", stdin);
		freopen("", "w", stdout);
	}
    	ios_base::sync_with_stdio(false);
    	cin.tie(0);
    	cout.tie(0);
	ll t = 1;
	if (IS_TEST_CASES) {
		cin >> t;
	}
	for (ll i = 0; i < t; i++) {
		solve();
	}
}