Problem: The Elements of Harmony are six supernatural artifacts representing subjective aspects of harmony. They are arguably the most powerful force in Equestria. The inside of Elements of Harmony can be seen as a complete graph with n vertices labeled from 0 to n - 1, where n is a power of two, equal to 2m.

<image>

The energy in Elements of Harmony is in constant movement. According to the ancient book, the energy of vertex u in time i (ei[u]) equals to: 

<image>

Here b[] is the transformation coefficient — an array of m + 1 integers and f(u, v) is the number of ones in the binary representation of number (u xor v).

Given the transformation coefficient and the energy distribution at time 0 (e0[]). Help Twilight Sparkle predict the energy distribution at time t (et[]). The answer can be quite large, so output it modulo p.

Input

The first line contains three integers m, t and p (1 ≤ m ≤ 20; 0 ≤ t ≤ 1018; 2 ≤ p ≤ 109). The following line contains n (n = 2m) integers e0[i] (1 ≤ e0[i] ≤ 109; 0 ≤ i < n). The next line contains m + 1 integers b[i] (0 ≤ b[i] ≤ 109; 0 ≤ i ≤ m).

Output

Output n lines, the i-th line must contain a single integer et[i] modulo p.

Examples

Input

2 2 10000
4 1 2 3
0 1 0


Output

14
6
6
14

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  long long r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long fpow(long long n, long long k, int p = (int)1e9 + 7) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = 2 * acos((long double)0);
long long mod64_mul(long long a, long long b, long long p) {
  a %= p;
  b %= p;
  long long r = 0;
  int block = 10;
  long long base = 1LL << block;
  for (; b; b >>= block) {
    r = (r + a * (b & (base - 1))) % p;
    a = a * base % p;
  }
  return r;
}
long long mod64_pow(long long n, long long k, long long p) {
  if (!n) return 0;
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = mod64_mul(r, n, p);
    n = mod64_mul(n, n, p);
  }
  return r;
}
void XORFFT(long long a[], int n, long long p, int invert) {
  for (int i = 1; i < n; i <<= 1) {
    for (int j = 0; j < n; j += i << 1) {
      for (int k = 0; k < i; k++) {
        long long u = a[j + k], v = a[i + j + k];
        a[j + k] = (u + v) % p;
        a[i + j + k] = (u - v + p) % p;
      }
    }
  }
  if (invert)
    for (int i = 0; i < n; i++) a[i] /= n;
}
const int maxm = 23;
const int maxn = 1 << maxm;
int n, m;
long long t, p;
long long a[maxn];
long long b[maxm];
long long e[maxn];
long long f[maxn];
void solve() {
  memset(f, -1, sizeof(f));
  scanf("%d%I64d%I64d", &m, &t, &p);
  n = 1 << m;
  p *= n;
  for (int i = (0); i < (n); i++) {
    scanf("%I64d", e + i);
    e[i] %= p;
  }
  for (int i = (0); i < (m + 1); i++) {
    scanf("%I64d", b + i);
    b[i] %= p;
  }
  for (int i = (0); i < (n); i++) a[i] = b[__builtin_popcount(i)];
  XORFFT(e, n, p, 0);
  XORFFT(a, n, p, 0);
  for (int i = (0); i < (n); i++) {
    if (!~f[__builtin_popcount(i)])
      a[i] = f[__builtin_popcount(i)] = mod64_pow(a[i], t, p);
    else
      a[i] = f[__builtin_popcount(i)];
  }
  for (int i = (0); i < (n); i++) a[i] = mod64_mul(a[i], e[i], p);
  XORFFT(a, n, p, 1);
  for (int i = (0); i < (n); i++) printf("%I64d\n", a[i]);
}
int main() {
  solve();
  return 0;
}