#include <bits/stdc++.h>
using namespace std;
template <int M>
struct modint {
  int val = 0;
  modint() {}
  modint(int a) : val(a) {
    while (val < 0) {
      val += M;
    }
    while (val >= M) {
      val -= M;
    }
  }
  modint(long long a) : val(a % M) {
    if (val < 0) {
      val += M;
    }
  }
  modint operator+=(modint oth) {
    val += oth.val;
    val -= (val >= M) ? M : 0;
    return *this;
  }
  modint operator-=(modint oth) {
    val -= oth.val;
    val += (val < 0) ? M : 0;
    return *this;
  }
  modint operator*=(modint oth) {
    val = 1LL * val * oth.val % M;
    return *this;
  }
  void operator++() {
    ++val;
    if (val == M) {
      val = 0;
    }
  }
  void operator--() {
    --val;
    if (val == -1) {
      val = M - 1;
    }
  }
  modint operator-() {
    modint res;
    res.val = (val == 0) ? 0 : M - val;
    return res;
  }
  int mod() { return M; }
  modint pow(int e) {
    modint base = val;
    modint res = 1;
    while (e > 0) {
      if (e % 2 == 1) {
        res *= base;
      }
      base *= base;
      e /= 2;
    }
    return res;
  }
  modint inv() { return pow(M - 2); }
  friend modint operator+(modint a, modint b) { return modint(a) += b; }
  friend modint operator-(modint a, modint b) { return modint(a) -= b; }
  friend modint operator*(modint a, modint b) { return modint(a) *= b; }
  friend bool operator==(modint a, modint b) { return a.val == b.val; }
  friend bool operator!=(modint a, modint b) { return a.val != b.val; }
};
using mint = modint<998244353>;
const int N = 1 << 16;
const int K = 16 + 1;
mint choose[K][K];
mint ways[K][N];
mint ans[N];
array<int, 2> number[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  for (int i = 0; i < K; ++i) {
    choose[i][0] = 1;
    for (int j = 1; j <= i; ++j) {
      choose[i][j] = choose[i - 1][j - 1] + choose[i - 1][j];
    }
  }
  int n, l, c;
  cin >> n >> l >> c;
  int initial = 0;
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    initial ^= a;
    int delta = 0;
    for (int j = 0; j <= l; ++j) {
      delta = max(delta, (a ^ (a - j)) / 2);
    }
    int b = 1;
    while (b <= delta) {
      b *= 2;
    }
    number[i] = {b, a};
  }
  sort(number, number + n);
  ways[0][0] = 1;
  for (int i = 0; i < n; ++i) {
    auto [b, a] = number[i];
    for (int j = l - 1; j >= 0; --j) {
      for (int jj = 1; j + jj <= l; ++jj) {
        for (int k = 0; k < b; ++k) {
          int delta = (a ^ (a - jj)) / 2;
          ways[j + jj][k ^ delta] += ways[j][k] * choose[l - j][jj];
        }
      }
    }
  }
  mint total = 0;
  for (int i = 0; i < (1 << (c - 1)); ++i) {
    total += ways[l][i];
  }
  total = total.inv();
  for (int i = 0; i < (1 << (c - 1)); ++i) {
    ans[(i * 2) ^ (l % 2) ^ initial] = ways[l][i] * total;
  }
  for (int i = 0; i < (1 << c); ++i) {
    cout << ans[i].val << " ";
  }
}

### Prompt

Construct a CPP code solution to the problem outlined:

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 

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
template <int M>
struct modint {
  int val = 0;
  modint() {}
  modint(int a) : val(a) {
    while (val < 0) {
      val += M;
    }
    while (val >= M) {
      val -= M;
    }
  }
  modint(long long a) : val(a % M) {
    if (val < 0) {
      val += M;
    }
  }
  modint operator+=(modint oth) {
    val += oth.val;
    val -= (val >= M) ? M : 0;
    return *this;
  }
  modint operator-=(modint oth) {
    val -= oth.val;
    val += (val < 0) ? M : 0;
    return *this;
  }
  modint operator*=(modint oth) {
    val = 1LL * val * oth.val % M;
    return *this;
  }
  void operator++() {
    ++val;
    if (val == M) {
      val = 0;
    }
  }
  void operator--() {
    --val;
    if (val == -1) {
      val = M - 1;
    }
  }
  modint operator-() {
    modint res;
    res.val = (val == 0) ? 0 : M - val;
    return res;
  }
  int mod() { return M; }
  modint pow(int e) {
    modint base = val;
    modint res = 1;
    while (e > 0) {
      if (e % 2 == 1) {
        res *= base;
      }
      base *= base;
      e /= 2;
    }
    return res;
  }
  modint inv() { return pow(M - 2); }
  friend modint operator+(modint a, modint b) { return modint(a) += b; }
  friend modint operator-(modint a, modint b) { return modint(a) -= b; }
  friend modint operator*(modint a, modint b) { return modint(a) *= b; }
  friend bool operator==(modint a, modint b) { return a.val == b.val; }
  friend bool operator!=(modint a, modint b) { return a.val != b.val; }
};
using mint = modint<998244353>;
const int N = 1 << 16;
const int K = 16 + 1;
mint choose[K][K];
mint ways[K][N];
mint ans[N];
array<int, 2> number[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  for (int i = 0; i < K; ++i) {
    choose[i][0] = 1;
    for (int j = 1; j <= i; ++j) {
      choose[i][j] = choose[i - 1][j - 1] + choose[i - 1][j];
    }
  }
  int n, l, c;
  cin >> n >> l >> c;
  int initial = 0;
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    initial ^= a;
    int delta = 0;
    for (int j = 0; j <= l; ++j) {
      delta = max(delta, (a ^ (a - j)) / 2);
    }
    int b = 1;
    while (b <= delta) {
      b *= 2;
    }
    number[i] = {b, a};
  }
  sort(number, number + n);
  ways[0][0] = 1;
  for (int i = 0; i < n; ++i) {
    auto [b, a] = number[i];
    for (int j = l - 1; j >= 0; --j) {
      for (int jj = 1; j + jj <= l; ++jj) {
        for (int k = 0; k < b; ++k) {
          int delta = (a ^ (a - jj)) / 2;
          ways[j + jj][k ^ delta] += ways[j][k] * choose[l - j][jj];
        }
      }
    }
  }
  mint total = 0;
  for (int i = 0; i < (1 << (c - 1)); ++i) {
    total += ways[l][i];
  }
  total = total.inv();
  for (int i = 0; i < (1 << (c - 1)); ++i) {
    ans[(i * 2) ^ (l % 2) ^ initial] = ways[l][i] * total;
  }
  for (int i = 0; i < (1 << c); ++i) {
    cout << ans[i].val << " ";
  }
}

```