#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
  if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
  if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using pi = pair<ll, ll>;
using vi = vc<ll>;
template <class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <class t>
ostream& operator<<(ostream& os, const vc<t>& v) {
  os << "{";
  for (auto e : v) os << e << ",";
  return os << "}";
}
using uint = unsigned;
using ull = unsigned long long;
template <class t, size_t n>
ostream& operator<<(ostream& os, const array<t, n>& first) {
  return os << vc<t>(first.begin(), first.end());
}
template <ll i, class T>
void print_tuple(ostream&, const T&) {}
template <ll i, class T, class H, class... Args>
void print_tuple(ostream& os, const T& t) {
  if (i) os << ",";
  os << get<i>(t);
  print_tuple<i + 1, T, Args...>(os, t);
}
template <class... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
  os << "{";
  print_tuple<0, tuple<Args...>, Args...>(os, t);
  return os << "}";
}
template <class t>
void print(t x, ll suc = 1) {
  cout << x;
  if (suc == 1) cout << "\n";
  if (suc == 2) cout << " ";
}
ll read() {
  ll i;
  cin >> i;
  return i;
}
vi readvi(ll n, ll off = 0) {
  vi v(n);
  for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off;
  return v;
}
template <class T>
void print(const vector<T>& v, ll suc = 1) {
  for (ll i = ll(0); i < ll(v.size()); i++)
    print(v[i], i == ll(v.size()) - 1 ? suc : 2);
}
string readString() {
  string s;
  cin >> s;
  return s;
}
template <class T>
T sq(const T& t) {
  return t * t;
}
void yes(bool ex = true) {
  cout << "Yes"
       << "\n";
  if (ex) exit(0);
}
void no(bool ex = true) {
  cout << "No"
       << "\n";
  if (ex) exit(0);
}
void possible(bool ex = true) {
  cout << "Possible"
       << "\n";
  if (ex) exit(0);
}
void impossible(bool ex = true) {
  cout << "Impossible"
       << "\n";
  if (ex) exit(0);
}
constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; }
const ll infLL = LLONG_MAX / 3;
const ll inf = infLL;
ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }
ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }
ll popcount(signed t) { return __builtin_popcount(t); }
ll popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(ll i) { return i && (i & -i) == i; }
ll mask(ll i) { return (ll(1) << i) - 1; }
bool inc(ll first, ll second, ll c) { return first <= second && second <= c; }
template <class t>
void mkuni(vc<t>& v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
ll rand_int(ll l, ll r) {
  static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
  return uniform_int_distribution<ll>(l, r)(gen);
}
template <class t>
void myshuffle(vc<t>& first) {
  for (ll i = ll(0); i < ll(ll(first.size())); i++)
    swap(first[i], first[rand_int(0, i)]);
}
template <class t>
ll lwb(const vc<t>& v, const t& first) {
  return lower_bound(v.begin(), v.end(), first) - v.begin();
}
struct modinfo {
  uint mod, root;
};
template <modinfo const& ref>
struct modular {
  static constexpr uint const& mod = ref.mod;
  static modular root() { return modular(ref.root); }
  uint v;
  modular(ll vv = 0) { s(vv % mod + mod); }
  modular& s(uint vv) {
    v = vv < mod ? vv : vv - mod;
    return *this;
  }
  modular operator-() const { return modular() - *this; }
  modular& operator+=(const modular& rhs) { return s(v + rhs.v); }
  modular& operator-=(const modular& rhs) { return s(v + mod - rhs.v); }
  modular& operator*=(const modular& rhs) {
    v = ull(v) * rhs.v % mod;
    return *this;
  }
  modular& operator/=(const modular& rhs) { return *this *= rhs.inv(); }
  modular operator+(const modular& rhs) const { return modular(*this) += rhs; }
  modular operator-(const modular& rhs) const { return modular(*this) -= rhs; }
  modular operator*(const modular& rhs) const { return modular(*this) *= rhs; }
  modular operator/(const modular& rhs) const { return modular(*this) /= rhs; }
  modular pow(ll n) const {
    modular res(1), x(*this);
    while (n) {
      if (n & 1) res *= x;
      x *= x;
      n >>= 1;
    }
    return res;
  }
  modular inv() const { return pow(mod - 2); }
  friend modular operator+(ll x, const modular& y) { return modular(x) + y; }
  friend modular operator-(ll x, const modular& y) { return modular(x) - y; }
  friend modular operator*(ll x, const modular& y) { return modular(x) * y; }
  friend modular operator/(ll x, const modular& y) { return modular(x) / y; }
  friend ostream& operator<<(ostream& os, const modular& m) {
    return os << m.v;
  }
  friend istream& operator>>(istream& is, modular& m) {
    ll x;
    is >> x;
    m = modular(x);
    return is;
  }
  bool operator<(const modular& r) const { return v < r.v; }
  bool operator==(const modular& r) const { return v == r.v; }
  bool operator!=(const modular& r) const { return v != r.v; }
  explicit operator bool() const { return v; }
};
template <class mint>
vi sweep(vvc<mint>& first, ll c = -1) {
  if (first.empty()) return {};
  if (c == -1) c = first[0].size();
  ll h = first.size(), w = first[0].size(), r = 0;
  vi res;
  for (ll i = ll(0); i < ll(c); i++) {
    if (r == h) break;
    for (ll j = ll(r); j < ll(h); j++)
      if (first[j][i].v) {
        swap(first[r], first[j]);
        break;
      }
    if (first[r][i].v == 0) continue;
    for (ll j = ll(0); j < ll(h); j++)
      if (j != r) {
        mint z = -first[j][i] / first[r][i];
        for (ll k = ll(i); k < ll(w); k++) first[j][k] += first[r][k] * z;
      }
    res.push_back(i);
    r++;
  }
  return res;
}
template <class mint>
vvc<mint> kernel(const vvc<mint>& first, ll w) {
  ll h = first.size();
  vvc<mint> second(w, vc<mint>(h + w));
  for (ll i = ll(0); i < ll(h); i++)
    for (ll j = ll(0); j < ll(w); j++) second[j][i] = first[i][j];
  for (ll i = ll(0); i < ll(w); i++) second[i][h + i] = 1;
  ll r = sweep(second, h).size();
  vvc<mint> res;
  for (ll i = ll(r); i < ll(w); i++)
    res.emplace_back(second[i].begin() + h, second[i].end());
  return res;
}
extern constexpr modinfo base{998244353, 3};
extern constexpr modinfo base2{2, 1};
using mint = modular<base>;
const ll vmax = (1 << 21) + 10;
mint fact[vmax], finv[vmax], invs[vmax];
void initfact() {
  fact[0] = 1;
  for (ll i = ll(1); i < ll(vmax); i++) {
    fact[i] = fact[i - 1] * i;
  }
  finv[vmax - 1] = fact[vmax - 1].inv();
  for (ll i = vmax - 2; i >= 0; i--) {
    finv[i] = finv[i + 1] * (i + 1);
  }
  for (ll i = vmax - 1; i >= 1; i--) {
    invs[i] = finv[i] * fact[i - 1];
  }
}
mint choose(ll n, ll k) { return fact[n] * finv[n - k] * finv[k]; }
mint binom(ll first, ll second) {
  return fact[first + second] * finv[first] * finv[second];
}
mint catalan(ll n) {
  return binom(n, n) - (n - 1 >= 0 ? binom(n - 1, n + 1) : 0);
}
vc<mint> getfreq(ll m, vi first) {
  ll n = ll(first.size());
  vc<mint> res(m + 1);
  ll cur = 0;
  for (ll bit = ll(0); bit < ll(1 << n); bit++) {
    for (ll j = ll(0); j < ll(n); j++)
      if ((bit ^ (bit - 1)) & 1 << j)
        cur ^= first[j];
      else
        break;
    res[popcount(cur)] += 1;
  }
  return res;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
  ll n, m;
  cin >> n >> m;
  vi first;
  ll cnt = 0;
  for (ll _ = ll(0); _ < ll(n); _++) {
    ll x;
    cin >> x;
    for (auto v : first) chmin(x, x ^ v);
    if (x)
      first.push_back(x);
    else
      cnt++;
  }
  vc<mint> ans(m + 1);
  if (ll(first.size()) <= m / 2) {
    void(0);
    ans = getfreq(m, first);
  } else {
    void(0);
    initfact();
    using mint2 = modular<base2>;
    vvc<mint2> vs(ll(first.size()), vc<mint2>(m));
    for (ll i = ll(0); i < ll(ll(first.size())); i++)
      for (ll j = ll(0); j < ll(m); j++) vs[i][j] = (first[i] >> j) & 1;
    auto ker = kernel(vs, m);
    vi second(ll(ker.size()));
    for (ll i = ll(0); i < ll(ll(ker.size())); i++)
      for (ll j = ll(0); j < ll(m); j++) second[i] += ll(ker[i][j].v) << j;
    auto z = getfreq(m, second);
    for (ll i = ll(0); i < ll(m + 1); i++) {
      for (ll c = ll(0); c < ll(i + 1); c++)
        for (ll d = ll(0); d < ll(m - i + 1); d++) {
          mint w = z[i] * choose(i, c) * choose(m - i, d);
          if (c & 1) w = -w;
          ans[c + d] += w;
        }
    }
    for (auto& v : ans) v /= mint(2).pow(m - ll(first.size()));
  }
  for (auto& v : ans) v *= mint(2).pow(cnt);
  print(ans);
}
