#include "bits/stdc++.h" using namespace std; #define DEBUG(x) cerr<<#x<<": "< #define vl vector #define vii vector< vector > #define vll vector< vector > #define vs vector #define pii pair #define pis pair #define psi pair #define pll pair template pair operator+(const pair &s, const pair &t) { return pair(s.first + t.first, s.second + t.second); } template pair operator-(const pair &s, const pair &t) { return pair(s.first - t.first, s.second - t.second); } template ostream& operator<<(ostream& os, pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define fi first #define se second #define rep(i,n) for(ll i=0;i<(ll)(n);i++) #define rep1(i,n) for(ll i=1;i<=(ll)(n);i++) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define rrep1(i,n) for(ll i=(ll)(n);i>0;i--) #define REP(i,a,b) for(ll i=(ll)a;i<(ll)b;i++) #define in(x, a, b) (a <= x && x < b) #define all(c) c.begin(),c.end() template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; } const ll inf = 1000000001; const ll INF = 2e18; const ll MOD = 1000000007; const double pi = 3.14159265358979323846; #define Sp(p) cout< P; vector

fft(vector

v, bool rev = false) { int n = v.size(), i, j, m; for (i = 0, j = 1; j> 1; k>(i ^= k); k >>= 1); if (i>j) swap(v[i], v[j]); } for (int m = 2; m <= n; m *= 2) { double deg = (rev ? -1 : 1) * 2 * acos(-1) / m; P wr(cos(deg), sin(deg)); for (i = 0; i MultPoly(vector

a, vector

b) { a = fft(a), b = fft(b); for (int i = 0; i> l >> m >> n; ll x = n; while (x&(x - 1)) x++; x *= 4; vector

a(x), b(x); rep (i, l) { int temp; cin >> temp; temp--; a[temp].real(1); } rep (i, m) { int temp; cin >> temp; temp--; b[n - temp].real(1); } auto ans = MultPoly(a, b); int q; cin >> q; REP(i, n, n + q) { cout << (int)(ans[i].real() + 0.5) << endl; } }