Problem: This is the hard version of the problem. The only difference between easy and hard versions is the constraint of m. You can make hacks only if both versions are solved.

Chiori loves dolls and now she is going to decorate her bedroom!

<image>

As a doll collector, Chiori has got n dolls. The i-th doll has a non-negative integer value a_i (a_i < 2^m, m is given). Chiori wants to pick some (maybe zero) dolls for the decoration, so there are 2^n different picking ways.

Let x be the bitwise-xor-sum of values of dolls Chiori picks (in case Chiori picks no dolls x = 0). The value of this picking way is equal to the number of 1-bits in the binary representation of x. More formally, it is also equal to the number of indices 0 ≤ i < m, such that \left⌊ (x)/(2^i) \right⌋ is odd.

Tell her the number of picking ways with value i for each integer i from 0 to m. Due to the answers can be very huge, print them by modulo 998 244 353.

Input

The first line contains two integers n and m (1 ≤ n ≤ 2 ⋅ 10^5, 0 ≤ m ≤ 53) — the number of dolls and the maximum value of the picking way.

The second line contains n integers a_1, a_2, …, a_n (0 ≤ a_i < 2^m) — the values of dolls.

Output

Print m+1 integers p_0, p_1, …, p_m — p_i is equal to the number of picking ways with value i by modulo 998 244 353.

Examples

Input


4 4
3 5 8 14


Output


2 2 6 6 0 

Input


6 7
11 45 14 9 19 81


Output


1 2 11 20 15 10 5 0 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int M = 55;
const int mod = 998244353;
const int inv2 = (mod + 1) / 2;
inline int pls(int a, int b) {
  a += b - mod;
  return a + (a >> 31 & mod);
}
inline int mns(int a, int b) {
  a -= b;
  return a + (a >> 31 & mod);
}
inline void inc(int& a, int b) {
  a += b - mod;
  a += a >> 31 & mod;
}
inline void dec(int& a, int b) {
  a -= b;
  a += a >> 31 & mod;
}
inline int fpow(int b, int k) {
  int res = 1;
  while (k) {
    if (k & 1) res = 1LL * res * b % mod;
    b = 1LL * b * b % mod;
    k >>= 1;
  }
  return res;
}
int _w;
int n, m, binom[M][M], W[M][M], k, ans[M];
long long A[M], B[M], f[M];
void dfs(int u, long long now) {
  if (u == k) return ++ans[__builtin_popcountll(now)], void();
  dfs(u + 1, now);
  dfs(u + 1, now ^ A[u]);
}
int main(void) {
  _w = scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) {
    long long x;
    _w = scanf("%lld", &x);
    for (int j = m - 1; ~j; --j)
      if ((x >> j) & 1) {
        if (!f[j]) f[j] = x;
        x ^= f[j];
      }
  }
  for (int i = 0; i < m; ++i)
    if (f[i]) {
      for (int j = 0; j < i; ++j)
        if ((f[i] >> j) & 1) f[i] ^= f[j];
      for (int j = 0; j < m; ++j)
        if (!f[j]) A[k] = A[k] * 2 + ((f[i] >> j) & 1);
      A[k] |= 1LL << (m - k);
      ++k;
    }
  if (k <= 26) {
    dfs(0, 0);
    int tmp = fpow(2, n - k);
    for (int i = 0; i <= m; ++i) printf("%lld ", 1LL * ans[i] * tmp % mod);
    return 0;
  }
  swap(A, B), k = m - k;
  for (int i = 0; i < k; ++i) {
    for (int j = 0; j < m - k; ++j)
      if ((B[j] >> i) & 1) A[i] |= 1LL << j;
    A[i] |= 1LL << (m - 1 - i);
  }
  dfs(0, 0);
  for (int i = 0; i <= m; ++i) {
    binom[i][0] = 1;
    for (int j = 1; j <= i; ++j)
      binom[i][j] = pls(binom[i - 1][j], binom[i - 1][j - 1]);
  }
  for (int i = 0; i <= m; ++i)
    for (int j = 0; j <= m; ++j)
      for (int k = 0; k <= i; ++k)
        if (k & 1)
          dec(W[i][j], 1LL * binom[j][k] * binom[m - j][i - k] % mod);
        else
          inc(W[i][j], 1LL * binom[j][k] * binom[m - j][i - k] % mod);
  int res;
  for (int i = 0; i <= m; ++i) {
    res = 0;
    for (int j = 0; j <= m; ++j) inc(res, 1LL * W[i][j] * ans[j] % mod);
    printf("%lld ", 1LL * fpow(2, (n - m + mod - 1) % (mod - 1)) * res % mod);
  }
  return 0;
}