省队集训day6 A

code：

 #include<cstdio>
 #include<iostream>
 #include<cmath>
 #include<cstring>
 #include<algorithm>
 #define maxn 262146
 #define mod 950009857
 #define g 7
 using namespace std;
 typedef long long int64;
 char ch;
 int n,m,k,x,N,len,rev[maxn];
 int64 a[maxn],b[maxn],c[maxn],wwn[][maxn],wn,w,t1,t2;
 bool ok;
 void read(int &x){
     for (ok=,ch=getchar();!isdigit(ch);ch=getchar()) if (ch=='-') ok=;
     for (x=;isdigit(ch);x=x*+ch-'',ch=getchar());
     if (ok) x=-x;
 }
 void read(int64 &x){
     for (ok=,ch=getchar();!isdigit(ch);ch=getchar()) if (ch=='-') ok=;
     for (x=;isdigit(ch);x=x*+ch-'',ch=getchar());
     if (ok) x=-x;
 }
 int re(int v){
     int t=;
     for (int i=;i<len;i++) t<<=,t|=v&,v>>=;
     return t;
 }
 int64 ksm(int64 a,int64 b){
     int64 t=;
     for (;b;b>>=){if (b&) t=t*a%mod; a=a*a%mod;}
     return t;
 }
 void ntt(int64 *a,int op){
     for (int i=;i<N;i++) if (i<rev[i]) swap(a[i],a[rev[i]]);
     for (int s=;s<=N;s<<=){
         wn=wwn[op][s];
         for (int i=;i<N;i+=s){
             w=;
             for (int j=i;j<i+(s>>);j++,w=w*wn%mod){
                 t1=a[j],t2=w*a[j+(s>>)]%mod;
                 a[j]=(t1+t2)%mod,a[j+(s>>)]=((t1-t2)%mod+mod)%mod;
             }
         }
     }
     if (op==){
         int64 x=ksm(N,mod-);
         for (int i=;i<N;i++) a[i]=a[i]*x%mod;
     }
 }
 int main(){
     read(n),read(m),read(k),N=;
     for (int i=;i<n;i++) read(a[i]);
     for (int i=;i<=m;i++) read(x),b[x]++;
     while (N<(n<<)) len++,N<<=;
     for (int i=;i<N;i++) rev[i]=re(i);
     for (int i=;i<=len;i++) wwn[][<<i]=ksm(g,(mod-)/(<<i));
     for (int i=;i<=len;i++) wwn[][<<i]=ksm(wwn[][<<i],mod-);
     for (;k;k>>=){
         ntt(b,);
         if (k&){
             ntt(a,);
             for (int i=;i<N;i++) a[i]=a[i]*b[i]%mod;
             ntt(a,);
             for (int i=n;i<N;i++) a[i]=;
         }
         for (int i=;i<N;i++) b[i]=b[i]*b[i]%mod;
         ntt(b,);
         for (int i=n;i<N;i++) b[i]=;
     }
     for (int i=;i<n;i++) printf("%lld ",a[i]);
     puts("");
     return ;
 }