func_code_string: #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<int, int>;   using vi = vc<int>;   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 <int i, class T>   void print_tuple(ostream&, const T&) {}   template <int 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, int suc = 1) {     cout << x;     if (suc == 1) cout <<   n ;     if (suc == 2) cout <<    ;   }   ll read() {     ll i;     cin >> i;     return i;   }   vi readvi(int n, int off = 0) {     vi v(n);     for (int i = int(0); i < int(n); i++) v[i] = read() + off;     return v;   }   template <class T>   void print(const vector<T>& v, int suc = 1) {     for (int i = int(0); i < int(v.size()); i++)       print(v[i], i == int(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(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }   const ll infLL = LLONG_MAX / 3;   const int inf = INT_MAX / 2 - 100;   int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }   int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }   int botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }   int botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }   int popcount(signed t) { return __builtin_popcount(t); }   int popcount(ll t) { return __builtin_popcountll(t); }   bool ispow2(int i) { return i && (i & -i) == i; }   ll mask(int i) { return (ll(1) << i) - 1; }   bool inc(int first, int second, int 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 (int i = int(0); i < int(int(first.size())); i++)       swap(first[i], first[rand_int(0, i)]);   }   template <class t>   int lwb(const vc<t>& v, const t& first) {     return lower_bound(v.begin(), v.end(), first) - v.begin();   }   using uint = unsigned;   using ull = unsigned long long;   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(int 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+(int x, const modular& y) { return modular(x) + y; }     friend modular operator-(int x, const modular& y) { return modular(x) - y; }     friend modular operator*(int x, const modular& y) { return modular(x) * y; }     friend modular operator/(int 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; }   };   extern constexpr modinfo base{998244353, 3};   using mint = modular<base>;   const int vmax = (1 << 21) + 10;   mint fact[vmax], finv[vmax], invs[vmax];   void initfact() {     fact[0] = 1;     for (int i = int(1); i < int(vmax); i++) {       fact[i] = fact[i - 1] * i;     }     finv[vmax - 1] = fact[vmax - 1].inv();     for (int i = vmax - 2; i >= 0; i--) {       finv[i] = finv[i + 1] * (i + 1);     }     for (int i = vmax - 1; i >= 1; i--) {       invs[i] = finv[i] * fact[i - 1];     }   }   mint choose(int n, int k) { return fact[n] * finv[n - k] * finv[k]; }   mint binom(int first, int second) {     return fact[first + second] * finv[first] * finv[second];   }   mint catalan(int n) {     return binom(n, n) - (n - 1 >= 0 ? binom(n - 1, n + 1) : 0);   }   void swapbit(ll& first, int i, int j) {     if (i == j) return;     for (int _ = int(0); _ < int(3); _++) {       ll x = (first >> i) & 1;       first ^= x << j;       swap(i, j);     }   }   const int S = 17;   mint dp[S + 1][1 << S];   signed main() {     cin.tie(0);     ios::sync_with_stdio(0);     cout << fixed << setprecision(20);     int n, m;     cin >> n >> m;     vc<ll> vs;     mint w = 1;     for (int _ = int(0); _ < int(n); _++) {       ll first;       cin >> first;       for (auto v : vs) chmin(first, first ^ v);       if (first == 0)         w *= 2;       else         vs.push_back(first);     }     vc<mint> ans(m + 1);     int s = int(vs.size());     if (int(vs.size()) <= 18) {       for (int bit = int(0); bit < int(1 << s); bit++) {         ll x = 0;         for (int i = int(0); i < int(s); i++)           if (bit & 1 << i) x ^= vs[i];         ans[popcount(x)] += 1;       }     } else {       for (int i = int(0); i < int(s); i++) {         assert(vs[i]);         int j = botbit(vs[i]);         assert(j >= i);         for (int k = int(0); k < int(s); k++)           if (k != i && vs[k] & 1LL << j) vs[k] ^= vs[i];         for (int k = int(0); k < int(s); k++) swapbit(vs[k], i, j);       }       int len = m - s;       assert(len <= S);       dp[0][0] = 1;       for (int i = int(0); i < int(s); i++) {         int v = vs[i] >> s;         for (int j = int(i + 1) - 1; j >= int(0); j--) {           for (int k = int(0); k < int(1 << len); k++) {             dp[j + 1][k ^ v] += dp[j][k];           }         }       }       for (int i = int(0); i < int(s + 1); i++)         for (int j = int(0); j < int(1 << len); j++) {           ans[i + popcount(j)] += dp[i][j];         }     }     for (auto& v : ans) v *= w;     print(ans);   }   