#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  char c = getchar();
  long long first = 0;
  bool f = 0;
  for (; !isdigit(c); c = getchar()) f ^= !(c ^ 45);
  for (; isdigit(c); c = getchar())
    first = (first << 1) + (first << 3) + (c ^ 48);
  if (f) first = -first;
  return first;
}
const long long inf = 1e18;
const long long N = 20;
const long long M = (1 << 19) + 10;
long long k, n, a[M], f[N][M];
long long son[M << 1][2], cnt;
vector<long long> minn[M << 1], maxn[M << 1];
void insert(long long first) {
  long long now = 0;
  for (long long i = k - 1; i >= 0; i--) {
    long long c = ((first >> i) & 1);
    if (!son[now][c]) son[now][c] = ++cnt;
    now = son[now][c];
  }
}
void dfs(long long u, long long first) {
  if (first == 0) {
    minn[u].push_back(0), maxn[u].push_back(0);
    return;
  }
  if (son[u][0]) dfs(son[u][0], first - 1);
  if (son[u][1]) dfs(son[u][1], first - 1);
  for (long long j = 0; j < (1 << first); j++) {
    long long c = (j >> (first - 1)) & 1, second = j - (1 << (first - 1)) * c;
    long long Min = inf, Max = 0;
    if (son[u][c])
      Min = min(Min, minn[son[u][c]][second]),
      Max = max(Max, maxn[son[u][c]][second]);
    if (son[u][c ^ 1])
      Min = min(Min, minn[son[u][c ^ 1]][second] + (1 << (first - 1))),
      Max = max(Max, maxn[son[u][c ^ 1]][second] + (1 << (first - 1)));
    if (son[u][c] && son[u][c ^ 1])
      f[first][j] =
          min(f[first][j], (1 << (first - 1)) + minn[son[u][c ^ 1]][second] -
                               maxn[son[u][c]][second]);
    minn[u].push_back(Min), maxn[u].push_back(Max);
  }
}
signed main() {
  n = read(), k = read();
  for (long long i = 1; i <= n; i++) a[i] = read(), insert(a[i]);
  memset(f, 0x3f, sizeof(f));
  dfs(0, k);
  for (long long i = 0; i < (1 << k); i++) {
    long long ans = inf;
    for (long long d = 1; d <= k; d++) ans = min(ans, f[d][i & ((1 << d) - 1)]);
    cout << ans << ' ';
  }
  return 0;
}
