1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<complex>
#include<cstdlib>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define mid (x+y>>1)
#define sqr(x) ((x)*(x))
#define NM 1100005
#define nm 400005
using namespace std;
const double pi=acos(-1);
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
int n,m;
ll _t,inf;
ll a[NM],b[NM],c[NM];
inline ll plu(long long x,long long y){
ll tmp=(x*y-(ll)((long double)x/inf*y+1.0e-8)*inf);
return tmp<0 ? tmp+inf : tmp;
}
ll qpow(ll x,ll t){
ll s=1;
for(;t;t>>=1,x=plu(x,x))if(t&1)s=plu(s,x);
return s;
}
void fwt(ll*a){
for(int k=1;k<n;k<<=1)
for(int i=0;i<n;i+=k<<1)
for(int j=0;j<k;j++){
ll x=a[i+j],y=a[i+j+k];
a[i+j]=(x+y)%inf;
a[i+j+k]=(x-y+inf)%inf;
}
}
int main(){
m=read();n=succ(m);_t=read();inf=read()*n;
inc(i,0,n-1)a[i]=read()%inf;
inc(i,0,m)b[i]=read()%inf;
inc(i,0,n-1)c[i]=b[__builtin_popcount(i)];
fwt(c);fwt(a);
inc(i,0,n-1)a[i]=plu(a[i],qpow(c[i],_t));
fwt(a);
inc(i,0,n-1)printf("%lld\n",a[i]/n);
return 0;
}
|
