#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 100'447;
const int B = 1 << 8;

int nxt[N][B];

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

	cerr << sizeof(nxt) << '\n';

	int n, b;
	cin >> n >> b;
	
	FOR (i, 0, n + 1) FOR (j, 0, 1 << b) nxt[i][j] = n;
	
	VI a(n);
	FOR (i, 0, n)
		cin >> a[i];
	VI res(n);
	RFOR (i, n, 0)
	{
		FOR (j, 0, 1 << b)
			nxt[i][j] = nxt[i + 1][j];
		FOR (j, 0, 1 << b)
		{
			if ((j & a[i]) == 0)
				nxt[i][j] = i;
		}
		int ans = 0;
		FOR (bb, 0, b)
		{
			int mask = 1 << bb;
			int j = nxt[i][mask];
			while (j < n)
			{
				ans += j + 1;
				mask |= a[j];
				j = nxt[j + 1][mask];
			}
		}
		res[i] = ans;
	}
	FOR (i, 0, n)
		cout << res[i] << ' ';
	cout << '\n';
	
	return 0;
}