#include <bits/stdc++.h>
using namespace std;
const int M = 55, P = 998244353;
int n, m, c[M][M], g[M][M];
long long b[M];
vector<long long> B, G;
int f[60], p[60];
long long pw(long long a, long long m) {
  long long res = 1;
  while (m) m & 1 ? res = res * a % P : 0, a = a * a % P, m >>= 1;
  return res;
}
void insert(long long x) {
  for (int i = 53; i >= int(0); --i)
    if (x >> i & 1) {
      if (!b[i]) return b[i] = x, void();
      x ^= b[i];
    }
  assert(x == 0);
}
void add(int &x, long long y) { x = (x + y) % P; }
void add(int &x, int y) { x = (x + y) % P; }
void work() {
  for (int i = 53; i >= int(0); --i)
    if (b[i]) {
      for (int j = i + 1; j <= int(53); ++j)
        if (b[j] >> i & 1) b[j] ^= b[i];
    }
  for (int i = 0; i <= int(53); ++i)
    if (b[i]) B.push_back(b[i]);
}
void dfs(int k, long long cur) {
  if (k == 0) {
    add(p[__builtin_popcountll(cur)], 1);
    return;
  }
  dfs(k - 1, cur);
  dfs(k - 1, cur ^ B[k - 1]);
}
void solve1() {
  dfs(B.size(), 0);
  long long coef = pw(2, n - B.size());
  for (int x = 0; x <= int(m); ++x) p[x] = p[x] * coef % P;
  for (int i = 0; i <= int(m); ++i) printf("%d%c", p[i], " \n"[i == m]);
}
void dfs2(int k, long long cur) {
  if (k == 0) {
    add(f[__builtin_popcountll(cur)], 1);
    return;
  }
  dfs2(k - 1, cur);
  dfs2(k - 1, cur ^ G[k - 1]);
}
void solve2() {
  c[0][0] = 1;
  for (int i = 1; i <= int(m); ++i) {
    c[i][0] = 1;
    for (int j = 1; j <= int(m); ++j)
      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % P;
  }
  auto sig = [](int x) { return 1 - 2 * (x & 1); };
  for (int x = 0; x <= int(m); ++x)
    for (int y = 0; y <= int(m); ++y) {
      for (int z = 0; z <= int(min(x, y)); ++z) {
        add(g[x][y], c[y][z] * 1ll * c[m - y][x - z] * sig(z));
      }
      add(g[x][y], P);
    }
  for (int i = 0; i <= int(m - 1); ++i)
    if (b[i] == 0) {
      long long s = 1ll << i;
      for (int j = 0; j <= int(m - 1); ++j)
        if (b[j] >> i & 1) s |= 1ll << j;
      if (s) G.push_back(s);
    }
  dfs2(G.size(), 0);
  long long coef = pw(pw(2, m - B.size()), P - 2);
  for (int x = 0; x <= int(m); ++x) {
    for (int y = 0; y <= int(m); ++y) {
      add(p[x], f[y] * 1ll * g[x][y]);
    }
    p[x] = p[x] * coef % P;
  }
  coef = pw(2, n - B.size());
  for (int x = 0; x <= int(m); ++x) p[x] = p[x] * coef % P;
  for (int i = 0; i <= int(m); ++i) printf("%d%c", p[i], " \n"[i == m]);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= int(n); ++i) {
    long long x;
    scanf("%lld", &x);
    insert(x);
  }
  work();
  if (B.size() <= 26)
    solve1();
  else
    solve2();
  return 0;
}
