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;
const int mod = 998244353;
int n, K, C, D;
int ar[17][17 << 1][17];
int inv[17];
int po[17][17 << 1], B[17 << 1][17];
int odd[32];
int pre[1 << 16], all[1 << 16];
namespace Calc {
int dec(int a, int b) { return a - b < 0 ? a - b + mod : a - b; }
int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
int mul(int a, int b) { return 1ll * a * b % mod; }
int Pow(int a, int b) {
  int res = 1;
  while (b) {
    if (b & 1) res = 1ll * res * a % mod;
    a = 1ll * a * a % mod;
    b >>= 1;
  }
  return res;
}
}  // namespace Calc
using namespace Calc;
void init(int i, int z) {
  for (int j = 0; j < (1 << (D + 1)); ++j)
    if (odd[((1 << (D + 1)) - 1 - j) & z])
      po[i][j] = dec(0, inv[i]);
    else
      po[i][j] = inv[i];
}
int to[17];
void Mul(int *A, int *B, int *C) {
  memset(to, 0, sizeof(int) * (K + 1));
  for (int i = 0; i <= K; ++i)
    for (int j = 0; j <= K - i; ++j)
      to[i + j] = add(to[i + j], mul(A[i], B[j]));
  memcpy(C, to, sizeof(int) * (K + 1));
}
void Div(int *A, int *B, int *C) {
  int t = Pow(B[0], mod - 2);
  for (int i = 0; i <= K; ++i) {
    int tmp = A[i];
    for (int j = 1; j <= i; ++j) tmp = dec(tmp, mul(B[j], to[i - j]));
    to[i] = mul(tmp, t);
  }
  memcpy(C, to, sizeof(int) * (K + 1));
}
void Pow(int *res, int *a, int b) {
  while (b) {
    if (b & 1) Mul(res, a, res);
    Mul(a, a, a);
    b >>= 1;
  }
}
int cnt[16][17];
void solve(int tmp, int c) {
  if (!cnt[tmp][c]) return;
  int zjr = cnt[tmp][c];
  tmp += (1 << (c + D));
  int pre = tmp;
  for (int i = 0; i <= K; ++i) {
    int z = (pre ^ tmp) & ((1 << D) - 1);
    if (!(tmp & (1 << (c + D)))) z += (1 << D);
    init(i, z);
    tmp--;
    for (int j = 0; j < (1 << (D + 1)); ++j) B[j][i] = po[i][j];
  }
  for (int i = 0; i < (1 << (D + 1)); ++i) Pow(ar[c][i], B[i], zjr);
}
int lowbit(int x) { return x & (-x); }
int bel[1 << 16], F[1 << 16][17], ans[1 << 16], fjz[1 << 16], pf[16];
void FWT(int *A) {
  for (int i = 1; i < (1 << D); i <<= 1)
    for (int j = 0; j < (1 << D); j += (i << 1))
      for (int k = 0; k < i; ++k) {
        int x = add(A[j + k], A[j + k + i]);
        int y = dec(A[j + k + i], A[j + k]);
        A[j + k] = mul(x, inv[2]);
        A[j + k + i] = mul(y, inv[2]);
      }
}
int main() {
  int Ans = 0;
  pf[0] = 1;
  for (int i = 1; i < 16; ++i) pf[i] = pf[i - 1] ^ (1 << i);
  for (int i = 0; i < 16; ++i) bel[1 << i] = i;
  for (int i = 1; i < 32; ++i) odd[i] = odd[i ^ lowbit(i)] ^ 1;
  inv[0] = inv[1] = 1;
  for (int i = 2; i < 17; ++i) inv[i] = mul(inv[mod % i], mod - mod / i);
  for (int i = 2; i < 17; ++i) inv[i] = mul(inv[i - 1], inv[i]);
  scanf("%d%d%d", &n, &K, &C);
  int x;
  D = 0;
  while ((1 << D) < K) D++;
  bool flg = 0;
  if (C == D) {
    flg = 1;
    C++;
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &x);
    Ans ^= x;
    all[x]++;
  }
  pre[0] = 0;
  for (int i = 1; i < (1 << (C - D)); ++i) pre[i] = bel[lowbit(i)];
  for (int i = 0; i < (1 << (C - D)); ++i)
    for (int j = 0; j < (1 << D); ++j) cnt[j][pre[i]] += all[(i << D) | j];
  for (int i = 0; i < C - D; ++i)
    for (int j = 0; j < (1 << (D + 1)); ++j) ar[i][j][0] = 1;
  for (int i = 0; i < (1 << D); ++i)
    for (int j = 0; j < C - D; ++j) solve(i, j);
  for (int i = 0; i < C - D; ++i)
    for (int j = 0; j < (1 << D); ++j)
      for (int k = 0; k <= K; ++k) {
        int t1 = add(ar[i][j][k], ar[i][j + (1 << D)][k]);
        int t2 = dec(ar[i][j + (1 << D)][k], ar[i][j][k]);
        ar[i][j][k] = mul(t1, inv[2]);
        ar[i][j + (1 << D)][k] = mul(t2, inv[2]);
      }
  for (int i = 0; i < (1 << D); ++i) {
    F[i][0] = 1;
    for (int j = 0; j < C - D; ++j) Mul(F[i], ar[j][i], F[i]);
    ans[i] = F[i][K];
    for (int j = 1; j < (1 << (C - D)); ++j) {
      Div(F[((j ^ lowbit(j)) << D) | i], ar[pre[j]][i], F[(j << D) | i]);
      Mul(F[(j << D) | i], ar[pre[j]][i | (1 << D)], F[(j << D) | i]);
      ans[(j << D) | i] = F[(j << D) | i][K];
    }
  }
  for (int i = 0; i < (1 << (C - D)); ++i) {
    int sta = 0;
    for (int j = 0; j < (C - D); ++j)
      if (i & (1 << j)) sta ^= pf[j];
    FWT(ans + i * (1 << D));
    for (int j = 0; j < (1 << D); ++j)
      fjz[(sta << D) ^ j ^ Ans] = ans[i * (1 << D) + j];
  }
  int fact = 1;
  for (int i = 1; i <= K; ++i) fact = mul(fact, i);
  fact = mul(fact, Pow(n, 1ll * (mod - 2) * K % (mod - 1)));
  if (flg) C--;
  for (int i = 0; i < (1 << C); ++i) printf("%d ", mul(fact, fjz[i]));
}