#pragma GCC optimize ("fast-math") #pragma GCC target ("avx") #include #include #define PI2 6.28318530717958647692528676655900577L char ibuf[1200100]; char *ibufe = ibuf-1; void readall(){ int k, t = 0; while((k=read(STDIN_FILENO, ibuf+t, sizeof(ibuf)-t))>0) t += k; } int read_uint(){ int x=0; while(*(++ibufe) <'0'); do { x *= 10; x += *ibufe-'0'; } while(*(++ibufe) >='0'); return x; } char buf[700000]; char *bufe = buf; void write_uintln(int x){ int i; static char tmp[13]; if(x==0){ *bufe++ = '0'; *bufe++ = '\n'; return; } for(i=0; x; i++){ tmp[i] = '0' + x % 10; x /= 10; } for(i--; i >= 0; i--){ *bufe++ = tmp[i]; } *bufe++ = '\n'; } void writeall(){ int k, t = 0; while((k=write(STDOUT_FILENO, buf+t, bufe-buf-t))>0) t += k; } const int k = 17; const int m = (1 << 17); typedef double complex cmplx; cmplx C[1<<17]; cmplx w[1<<16]; void fft(int k, cmplx *A, const cmplx *w){ const int m = 1 << k; int u = 1; int v = m/4; int i, j; if(k&1){ for(j=0; j>= 1; } for(i=k&~1;i>0;i-=2){ int jh; for(jh=0;jh>= 2; } } void ifft(int k, cmplx *A, const cmplx *w){ const int m = 1 << k; int u = m/4; int v = 1; int i, j; for(i=2;i<=k;i+=2){ int jh; for(jh=0;jh>= 2; v <<= 2; } if(k&1){ for(j = 0;j>1, z); genw(i|b, b>>1, z*w[b]); } } void convolver(int k, cmplx *A, const cmplx *w){ int i, y; const int m = 1 << k; fft(k, A, w); A[0] = 4 * creal(A[0]) * cimag(A[0]) * I; A[1] = 4 * creal(A[1]) * cimag(A[1]) * I; i = 2; for(y = 2; y < m; y <<= 1){ for(; i < 2*y; i+=2){ int j = i^(y-1); A[i] = (A[i] + conj(A[j]))*(A[i] - conj(A[j])); A[j] = -conj(A[i]); } } for(i = 0; i < m; i+=2){ A[i/2] = (A[i]+A[i^1] - (A[i]-A[i^1])*w[i/2]*I)/(4*m); } ifft(k-1, A, w); } int main(){ int l, mm, q; int i, j; const long double arg = -PI2/m; const int B = 100001; for(i=1, j=m/4; j; i<<=1, j>>=1){ w[i] = cexp(I * (arg * j)); } genw(0, m/4, 1); readall(); l = read_uint(); mm = read_uint(); read_uint(); for(i=0;i