#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2000005;
const int MAXK = 20;
const int INF = 0x3f3f3f3f;
int inline read() {
  int x = 0, f = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') f ^= (ch == '-'), ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + (ch ^ 48), ch = getchar();
  return f ? -x : x;
}
int n, k, a[MAXN];
int f[MAXN], minn[MAXN], maxn[MAXN];
signed main() {
  memset(f, 0x3f, sizeof(f));
  memset(minn, 0x3f, sizeof(minn));
  memset(maxn, ~0x3f, sizeof(maxn));
  n = read();
  k = read();
  for (int i = 1; i <= n; ++i) {
    int x = read();
    maxn[x] = minn[x] = 0;
  }
  for (int i = 0; i < k; ++i)
    for (int x = 0; x < (1 << k); ++x)
      if (x & (1 << i)) {
        ;
        int y = x ^ (1 << i);
        f[x] = f[y] = min(f[x], f[y]);
        f[x] = min(f[x], minn[y] - maxn[x] + (1 << i));
        f[y] = min(f[y], minn[x] - maxn[y] + (1 << i));
        int mnx = minn[x], mny = minn[y], mxx = maxn[x], mxy = maxn[y];
        minn[x] = min(mnx, mny + (1 << i));
        minn[y] = min(mny, mnx + (1 << i));
        maxn[x] = max(mxx, mxy + (1 << i));
        maxn[y] = max(mxy, mxx + (1 << i));
      }
  for (int i = 0; i < (1 << k); ++i) printf("%d ", f[i]);
}
