Problem: You are given a positive integer k and an array a_1, a_2, …, a_n of non-negative distinct integers not smaller than k and not greater than 2^c-1.

In each of the next k seconds, one element is chosen randomly equiprobably out of all n elements and decreased by 1.

For each integer x, 0 ≤ x ≤ 2^c - 1, you need to find the probability that in the end the bitwise XOR of all elements of the array is equal to x. 

Each of these values can be represented as an irreducible fraction p/q, and you need to find the value of p ⋅ q^{-1} modulo 998 244 353. 

Input

The first line of input contains three integers n, k, c (1 ≤ n ≤ (2^c - k), 1 ≤ k ≤ 16, 1 ≤ c ≤ 16).

The second line contains n distinct integers a_1, a_2, …, a_n (k ≤ a_i ≤ 2^c-1).

Output

Print 2^c integers: the probability that the bitwise XOR is equal to x in the end for x in \{0, 1, …, 2^c-1\} modulo 998 244 353.

Example

Input


4 1 3
1 2 3 4


Output


0 0 0 748683265 0 499122177 0 748683265 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
template <class T>
using V = vector<T>;
template <class T, size_t SZ>
using AR = array<T, SZ>;
const int MOD = 998244353;
const int MX = 2e5 + 5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);
const int xd[4] = {1, 0, -1, 0}, yd[4] = {0, 1, 0, -1};
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31 - __builtin_clz(x); }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
template <class T>
bool ckmin(T& a, const T& b) {
  return b < a ? a = b, 1 : 0;
}
template <class T>
bool ckmax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0;
}
template <class T, class U>
T fstTrue(T lo, T hi, U first) {
  hi++;
  assert(lo <= hi);
  while (lo < hi) {
    T mid = lo + (hi - lo) / 2;
    first(mid) ? hi = mid : lo = mid + 1;
  }
  return lo;
}
template <class T, class U>
T lstTrue(T lo, T hi, U first) {
  lo--;
  assert(lo <= hi);
  while (lo < hi) {
    T mid = lo + (hi - lo + 1) / 2;
    first(mid) ? lo = mid : hi = mid - 1;
  }
  return lo;
}
template <class T>
void remDup(vector<T>& v) {
  sort(begin(v), end(v));
  v.erase(unique(begin(v), end(v)), end(v));
}
template <class T, class U>
void erase(T& t, const U& u) {
  auto it = t.find(u);
  assert(it != end(t));
  t.erase(u);
}
template <class T>
void re(complex<T>& c);
template <class T, class U>
void re(pair<T, U>& p);
template <class T>
void re(vector<T>& v);
template <class T, size_t SZ>
void re(AR<T, SZ>& a);
template <class T>
void re(T& x) {
  cin >> x;
}
void re(db& d) {
  str t;
  re(t);
  d = stod(t);
}
void re(ld& d) {
  str t;
  re(t);
  d = stold(t);
}
template <class T, class... U>
void re(T& t, U&... u) {
  re(t);
  re(u...);
}
template <class T>
void re(complex<T>& c) {
  T a, b;
  re(a, b);
  c = {a, b};
}
template <class T, class U>
void re(pair<T, U>& p) {
  re(p.first, p.second);
}
template <class T>
void re(vector<T>& x) {
  for (auto& a : x) re(a);
}
template <class T, size_t SZ>
void re(AR<T, SZ>& x) {
  for (auto& a : x) re(a);
}
str to_string(char c) { return str(1, c); }
str to_string(const char* second) { return (str)second; }
str to_string(str second) { return second; }
str to_string(bool b) { return to_string((int)b); }
template <class T>
str to_string(complex<T> c) {
  stringstream ss;
  ss << c;
  return ss.str();
}
str to_string(vector<bool> v) {
  str res = "{";
  for (int i = (0); i < ((int)(v).size()); ++i) res += char('0' + v[i]);
  res += "}";
  return res;
}
template <size_t SZ>
str to_string(bitset<SZ> b) {
  str res = "";
  for (int i = (0); i < (SZ); ++i) res += char('0' + b[i]);
  return res;
}
template <class T, class U>
str to_string(pair<T, U> p);
template <class T>
str to_string(T v) {
  bool fst = 1;
  str res = "";
  for (const auto& x : v) {
    if (!fst) res += " ";
    fst = 0;
    res += to_string(x);
  }
  return res;
}
template <class T, class U>
str to_string(pair<T, U> p) {
  return to_string(p.first) + " " + to_string(p.second);
}
template <class T>
void pr(T x) {
  cout << to_string(x);
}
template <class T, class... U>
void pr(const T& t, const U&... u) {
  pr(t);
  pr(u...);
}
void ps() { pr("\n"); }
template <class T, class... U>
void ps(const T& t, const U&... u) {
  pr(t);
  if (sizeof...(u)) pr(" ");
  ps(u...);
}
void DBG() { cerr << "]" << endl; }
template <class T, class... U>
void DBG(const T& t, const U&... u) {
  cerr << to_string(t);
  if (sizeof...(u)) cerr << ", ";
  DBG(u...);
}
void setIn(str second) { freopen(second.c_str(), "r", stdin); }
void setOut(str second) { freopen(second.c_str(), "w", stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str second = "") {
  unsyncIO();
  if ((int)(second).size()) {
    setIn(second + ".in"), setOut(second + ".out");
  }
}
template <int MOD, int RT>
struct mint {
  static const int mod = MOD;
  static constexpr mint rt() { return RT; }
  int v;
  explicit operator int() const { return v; }
  mint() { v = 0; }
  mint(ll _v) {
    v = (-MOD < _v && _v < MOD) ? _v : _v % MOD;
    if (v < 0) v += MOD;
  }
  friend bool operator==(const mint& a, const mint& b) { return a.v == b.v; }
  friend bool operator!=(const mint& a, const mint& b) { return !(a == b); }
  friend bool operator<(const mint& a, const mint& b) { return a.v < b.v; }
  friend void re(mint& a) {
    ll x;
    re(x);
    a = mint(x);
  }
  friend str to_string(mint a) { return to_string(a.v); }
  mint& operator+=(const mint& m) {
    if ((v += m.v) >= MOD) v -= MOD;
    return *this;
  }
  mint& operator-=(const mint& m) {
    if ((v -= m.v) < 0) v += MOD;
    return *this;
  }
  mint& operator*=(const mint& m) {
    v = (ll)v * m.v % MOD;
    return *this;
  }
  mint& operator/=(const mint& m) { return (*this) *= inv(m); }
  friend mint pow(mint a, ll p) {
    mint ans = 1;
    assert(p >= 0);
    for (; p; p /= 2, a *= a)
      if (p & 1) ans *= a;
    return ans;
  }
  friend mint inv(const mint& a) {
    assert(a.v != 0);
    return pow(a, MOD - 2);
  }
  mint operator-() const { return mint(-v); }
  mint& operator++() { return *this += 1; }
  mint& operator--() { return *this -= 1; }
  friend mint operator+(mint a, const mint& b) { return a += b; }
  friend mint operator-(mint a, const mint& b) { return a -= b; }
  friend mint operator*(mint a, const mint& b) { return a *= b; }
  friend mint operator/(mint a, const mint& b) { return a /= b; }
};
typedef mint<MOD, 5> mi;
vi invs, fac, ifac;
void genFac(int SZ) {
  invs.resize(SZ), fac.resize(SZ), ifac.resize(SZ);
  invs[1] = fac[0] = ifac[0] = 1;
  for (int i = (2); i < (SZ); ++i)
    invs[i] = MOD - (ll)MOD / i * invs[MOD % i] % MOD;
  for (int i = (1); i < (SZ); ++i) {
    fac[i] = (ll)fac[i - 1] * i % MOD;
    ifac[i] = (ll)ifac[i - 1] * invs[i] % MOD;
  }
}
vector<vector<mi> > scmb;
void genComb(int SZ) {
  scmb.assign(SZ, vector<mi>(SZ));
  scmb[0][0] = 1;
  for (int i = (1); i < (SZ); ++i)
    for (int j = (0); j < (i + 1); ++j)
      scmb[i][j] = scmb[i - 1][j] + (j ? scmb[i - 1][j - 1] : 0);
}
template <class T>
void fft(V<T>& A, bool inv = 0) {
  int n = (int)(A).size();
  assert((T::mod - 1) % n == 0);
  V<T> B(n);
  for (int b = n / 2; b; b /= 2, swap(A, B)) {
    T w = pow(T::rt(), (T::mod - 1) / n * b), m = 1;
    for (int i = 0; i < n; i += b * 2, m *= w)
      for (int j = (0); j < (b); ++j) {
        T u = A[i + j], v = A[i + j + b] * m;
        B[i / 2 + j] = u + v;
        B[i / 2 + j + n / 2] = u - v;
      }
  }
  if (inv) {
    reverse(1 + begin(A), end(A));
    T z = T(1) / T(n);
    for (auto& t : A) t *= z;
  }
}
template <class T>
V<T> mul(V<T> A, V<T> B) {
  if (!min((int)(A).size(), (int)(B).size())) return {};
  int second = (int)(A).size() + (int)(B).size() - 1, n = 1;
  for (; n < second; n *= 2)
    ;
  bool eq = A == B;
  A.resize(n), fft(A);
  if (eq)
    B = A;
  else
    B.resize(n), fft(B);
  for (int i = (0); i < (n); ++i) A[i] *= B[i];
  fft(A, 1);
  A.resize(second);
  return A;
}
template <class M, class T>
V<M> mulMod(V<T> x, V<T> y) {
  auto con = [](const V<T>& v) {
    V<M> w((int)(v).size());
    for (int i = (0); i < ((int)(v).size()); ++i) w[i] = (int)v[i];
    return w;
  };
  return mul(con(x), con(y));
}
template <class T>
V<T> MUL(const V<T>& A, const V<T>& B) {
  using m0 = mint<(119 << 23) + 1, 62>;
  auto c0 = mulMod<m0>(A, B);
  using m1 = mint<(5 << 25) + 1, 62>;
  auto c1 = mulMod<m1>(A, B);
  using m2 = mint<(7 << 26) + 1, 62>;
  auto c2 = mulMod<m2>(A, B);
  int n = (int)(c0).size();
  V<T> res(n);
  m1 r01 = 1 / m1(m0::mod);
  m2 r02 = 1 / m2(m0::mod), r12 = 1 / m2(m1::mod);
  for (int i = (0); i < (n); ++i) {
    int a = c0[i].v, b = ((c1[i] - a) * r01).v,
        c = (((c2[i] - a) * r02 - b) * r12).v;
    res[i] = (T(c) * m1::mod + b) * m0::mod + a;
  }
  return res;
}
int n, k, c;
map<int, int> todo[17];
void fwht(vector<mi>& v) {
  int n = (int)(v).size();
  for (int bit = 1; bit < n; bit *= 2) {
    for (int i = (0); i < (n); ++i)
      if (!(i & bit)) {
        tie(v[i], v[i + bit]) = make_pair(v[i] + v[i + bit], v[i] - v[i + bit]);
      }
  }
}
vector<mi> tran(int i, int x) {
  assert(x & ((1 << i) - 1));
  vector<mi> res(1 << i);
  for (int z = (0); z < (k + 1); ++z) {
    res[x - z] += ifac[z];
  }
  return res;
}
void AD(vector<mi>& a, vector<mi>& b, int c, mi d) {
  for (int i = (0); i < ((int)(b).size()); ++i) a[i ^ c] += b[i] * d;
}
void ad(int i, V<vector<mi> >& a, int b) {
  V<vector<mi> > res(k + 1, vector<mi>(1 << i));
  for (int i = (k + 1) - 1; i >= (0); --i)
    for (int j = (0); j < (k + 1 - i); ++j)
      AD(res[i + j], a[i], b - j, ifac[j]);
  a = res;
}
vector<mi> getAns() {
  V<vector<mi> > res(k + 1, {0});
  res[0] = {1};
  for (int i = (1); i < (c + 1); ++i) {
    0;
    for (auto& t : res) t.resize(1 << i);
    for (auto& t : todo[i]) {
      for (int j = (0); j < (t.second); ++j) ad(i, res, t.first);
    }
  }
  return res[k];
}
int main() {
  genFac(20);
  setIO();
  re(n, k, c);
  int xo = 0;
  int cnt = 16;
  for (int _ = (0); _ < (n); ++_) {
    int x;
    re(x);
    int bits = 0;
    while ((x & ((1 << bits) - 1)) < k) bits++;
    int lef = x & ((1 << bits) - 1);
    xo ^= x ^ lef;
    todo[bits][lef]++;
  }
  vector<mi> v = getAns();
  vector<mi> ans(1 << c);
  for (int i = (0); i < ((int)(v).size()); ++i) ans[i ^ xo] = v[i];
  mi sum = 0;
  for (auto& t : ans) sum += t;
  for (auto& t : ans) t /= sum;
  for (auto& t : ans) pr(t, ' ');
  ps();
}