#include <bits/stdc++.h>

using namespace std;
#define int long long
const int MOD = 1000000007;
// 特殊な剰余と原始根
// (924844033, 5)
// (998244353, 3)
// (1012924417, 5)
// (167772161, 3)
// (469762049, 3)
// (1224736769, 3)

#define MOD 998244353
#define root 3

unsigned int add(const unsigned int x, const unsigned int y) {
	return (x + y < MOD) ? x + y : x + y - MOD;
}

unsigned int sub(const unsigned int x, const unsigned int y) {
	return (x >= y) ? (x - y) : (MOD - y + x);
}

unsigned int mul(const unsigned int x, const unsigned int y) {
	return (unsigned long long)x * y % MOD;
}

unsigned int mod_pow(unsigned int x, unsigned int n) {
	unsigned int res = 1;
	while (n > 0) {
		if (n & 1) {
			res = mul(res, x);
		}
		x = mul(x, x);
		n >>= 1;
	}
	return res;
}

unsigned int inverse(const unsigned int x) {
	return mod_pow(x, MOD - 2);
}

void ntt(vector<int>& a, const bool rev = false) {
	unsigned int i, j, k, l, p, q, r, s;
	const unsigned int size = a.size();
	if (size == 1) return;
	vector<int> b(size);
	r = rev ? (MOD - 1 - (MOD - 1) / size) : (MOD - 1) / size;
	s = mod_pow(root, r);
	vector<unsigned int> kp(size / 2 + 1, 1);
	for (i = 0; i < size / 2; ++i) kp[i + 1] = mul(kp[i], s);
	for (i = 1, l = size / 2; i < size; i <<= 1, l >>= 1) {
		for (j = 0, r = 0; j < l; ++j, r += i) {
			for (k = 0, s = kp[i * j]; k < i; ++k) {
				p = a[k + r], q = a[k + r + size / 2];
				b[k + 2 * r] = add(p, q);
				b[k + 2 * r + i] = mul(sub(p, q), s);
			}
		}
		swap(a, b);
	}
	if (rev) {
		s = inverse(size);
		for (i = 0; i < size; i++) {
			a[i] = mul(a[i], s);
		}
	}
}

vector<int> convolute(const vector<int>& a, const vector<int>& b) {
	const int size = (int)a.size() + (int)b.size() - 1;
	int t = 1;
	while (t < size) {
		t <<= 1;
	}
	vector<int> A(t, 0), B(t, 0);
	for (int i = 0; i < (int)a.size(); i++) {
		A[i] = a[i];
	}
	for (int i = 0; i < (int)b.size(); i++) {
		B[i] = b[i];
	}
	ntt(A), ntt(B);
	for (int i = 0; i < t; i++) {
		A[i] = mul(A[i], B[i]);
	}
	ntt(A, true);
	A.resize(size);
	return A;
}
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N, Q;
	cin >> N >> Q;
	vector<int> A(N);
	int res = 0;
	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}
	vector<int> B(Q);
	for (int i = 0; i < Q; i++) {
		cin >> B[i];
	}
	vector<vector<int> > X(N);
	for (int i = 0; i < N; i++) {
		X[i].push_back((A[i] - 1) % MOD);
		X[i].push_back(1);
	}
	while (X.size() >= 2) {
		vector<vector<int> > nX;
		for (int i = 0; i + 1 < X.size(); i += 2) {
			nX.push_back(convolute(X[i], X[i + 1]));
		}
		if (X.size() % 2) {
			nX.push_back(X.back());
		}
		swap(X, nX);
	}
	for (int i = 0; i < Q; i++) {
		cout << X[0][B[i]] << endl;
	}
}