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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
#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 mid ((x+y)/2)
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define NM 200005
#define nm 400005
using namespace std;
const double pi=acos(-1);
const ll inf=998244353;
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;
ll a[NM],b[NM],c[NM],d[NM];
struct FWT{
int n;
ll b[NM];
void fwt(ll*a,int f){
if(f==-1)f=inf+1>>1;
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]=f*(x+y)%inf;
a[i+j+k]=f*(x-y+inf)%inf;
}
}
int plu(ll*a,ll*_b,int p,int m){
inc(i,0,m-1)b[i]=_b[i];
for(n=1;n<p||n<m;n<<=1);
fwt(a,1);fwt(b,1);inc(i,0,n-1)a[i]=a[i]*b[i]%inf;
fwt(a,-1);inc(i,0,n-1)b[i]=0;return n;
}
}fwt;
struct FMTor{
int n;
ll b[NM];
void fmt(ll*a,int f){
for(int i=0;succ(i)<n;i++)
inc(j,0,n-1)if(j>>i&1)
a[j]=(a[j]+f*a[j^1<<i]+inf)%inf;
}
int plu(ll*a,ll*_b,int p,int m){
inc(i,0,m-1)b[i]=_b[i];
for(n=1;n<p||n<m;n<<=1);
fmt(a,1);fmt(b,1);inc(i,0,n-1)a[i]=a[i]*b[i]%inf;
fmt(a,-1);inc(i,0,n-1)b[i]=0;return n;
}
}fmtor;
struct FMTand{
int n;
ll b[NM];
void fmt(ll*a,int f){
for(int i=0;succ(i)<n;i++)
dec(j,n-1,0)if(~j>>i&1)
a[j]=(a[j]+f*a[j|1<<i]+inf)%inf;
}
int plu(ll*a,ll*_b,int p,int m){
inc(i,0,m-1)b[i]=_b[i];
for(n=1;n<p||n<m;n<<=1);
fmt(a,1);fmt(b,1);inc(i,0,n-1)a[i]=a[i]*b[i]%inf;
fmt(a,-1);inc(i,0,n-1)b[i]=0;return n;
}
}fmtand;
int main(){
n=1<<read();
inc(i,0,n-1)a[i]=c[i]=d[i]=read();
inc(i,0,n-1)b[i]=read();
fmtand.plu(a,b,n,n);
fmtor.plu(c,b,n,n);
fwt.plu(d,b,n,n);
inc(i,0,n-1)printf("%lld%c",c[i]," \n"[i==n-1]);
inc(i,0,n-1)printf("%lld%c",a[i]," \n"[i==n-1]);
inc(i,0,n-1)printf("%lld%c",d[i]," \n"[i==n-1]);
return 0;
}
|
