#include<bits/stdc++.h>
using namespace std;
const long long mod = 998244353, MAXN = 10000;
long long n, m, a[1009], b[1009], f[10050];
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i];
	}
	f[0] = 1;
	for (int j = 1; j <= n; j++) {
		long long x1 = (a[j] - b[j] + 1 + mod) % mod, x2 = ((a[j] + b[j]) % mod + mod - 2) % mod;
		for (int i = MAXN; i >= 0; i--) {
			f[i + 2] += x1 * f[i] % mod;
			f[i + 2] %= mod;
			f[i + 1] += x2 * f[i] % mod;
			f[i + 1] %= mod;
		}
		int cccnt = 3;
		while (cccnt--) {
			for (int i = 1; i <= MAXN; i++) {
				f[i] += f[i - 1];
				f[i] %= mod;
			}
		}
	}
	cin >> m;
	long long w;
	while (m--) {
		cin >> w;
		cout << f[w] << endl;
	}
	return 0;
}