#include <bits/stdc++.h>
#define ms(x, v) memset(x, v, sizeof(x))
#define il __attribute__((always_inline))
#define U(i,l,r) for(int i(l),END##i(r);i<=END##i;++i)
#define D(i,r,l) for(int i(r),END##i(l);i>=END##i;--i)
using namespace std;

typedef unsigned long long ull;
typedef long long ll;

//const int SZ(1 << 23);
//unsigned char buf[SZ], *S, *Q;
//#define getchar() ((S==Q)&&(Q=buf+fread(S=buf,1,SZ,stdin)),S==Q?EOF:*S++)
template <typename T>
void rd(T& s) {
	int c = getchar();
	T f = 1; s = 0;
	while (!isdigit(c)) { if (c == '-') f = -1; c = getchar(); }
	while (isdigit(c)) { s = s * 10 + (c ^ 48); c = getchar(); }
	s *= f;
}
template <typename T, typename... Y>
void rd(T& x, Y&... y) { rd(x), rd(y...); }
template <typename T>
void pr(T s, bool f = 1) {
    if (s < 0) { printf("-"); s = -s; }
    if (!s) return void(f ? printf("0") : 0);
    pr(s / 10, 0);
    printf("%d", (signed)(s % 10));
}
#define meow(...) fprintf(stderr, __VA_ARGS__)

const int N = 1048576;
int n, m, a[N], b[N], f[N], lim;
void sum() {
	for (int i = 1; (1 << i) <= lim; ++i)
		for (int k = 0; k < (1 << (i - 1)); ++k)
			for (int j = 0; j + k + (1 << (i - 1)) <= lim; j += (1 << i))
				a[j + k + (1 << (i - 1))] ^= a[j + k];
}

int main() {
	rd(n, m); U (i, 0, n - 1) rd(a[i]), b[i] = a[i] ^ (i ? b[i - 1] : 0);
	printf("%d ", b[n - 1]);
	reverse(a, a + n);
	lim = 1;
	while (lim <= n || lim <= m) lim <<= 1;
//	lim = 16384;
	sum();
	
	U (i, 1, m - 1)
		printf("%d ", a[(lim - 1) & (~i)]);
	return 0;
}