#include <bits/stdc++.h>

using namespace std;

typedef long long i64;
const int MAX_M = 1000 + 5;
const int MAX_N = 10000 + 5;
const int P = 998244353;

int M, Q, N;
int va[MAX_N], vb[MAX_N];
int qn[MAX_N];
int f[MAX_N], g[MAX_N], h[MAX_N], p[MAX_N];

int main() {
    scanf("%d", &M);
    for (int i = 1; i <= M; i ++) {
        scanf("%d%d", &va[i], &vb[i]);
    }
    scanf("%d", &Q);
    for (int i = 1; i <= Q; i ++) {
        scanf("%d", &qn[i]);
        N = max(N, qn[i]);
    }
    f[0] = 1;
    for (int i = 1; i <= M; i ++) {
        i64 a = va[i] % P, b = vb[i] % P;
        i64 A = 2 * a % P;
        i64 B = (b - a * 3 + P * 3ll) % P;
        i64 C = (a - b + 1 + P) % P;
        g[0] = h[0] = p[0] = f[0];
        for (int j = 1; j <= N; j ++) {
            g[j] = g[j - 1] + f[j];
            g[j] -= g[j] >= P ? P : 0;
            h[j] = h[j - 1] + g[j];
            h[j] -= h[j] >= P ? P : 0;
            p[j] = p[j - 1] + h[j];
            p[j] -= p[j] >= P ? P : 0;
            f[j] = (C * g[j] + B * h[j] + A * p[j]) % P;
        }
    }
    for (int i = 1; i <= Q; i ++) {
        printf("%d\n", f[qn[i]]);
    }
    return 0;
}