#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;
const int mod=998244353;
const int MN=1005;
ll n,m,q,x[MN],a[MN],b[MN],ans;
void write(ll n){if(n<0){putchar('-');write(-n);return;}if(n>9)write(n/10);putchar(n%10+'0');}
ll read(){ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
void work(){
    ll res=1;
    for(int i=1; i<=n; i++){
        ll num=(a[i]*x[i]%mod*x[i]%mod+b[i]*x[i]%mod+1)%mod;
        res=res*num%mod;
    }
    ans=(ans+res)%mod;
}
void dfs(ll step, ll num){
    if(num>m) return;
    if(step==n){
        x[step]=m-num;
        work();
        return;
    }
    for(int i=0; i<=m-num; i++){
        x[step]=i;
        dfs(step+1,num+i);
    }
}
int main(){
    n=read();
    for(int i=1; i<=n; i++) a[i]=read(),b[i]=read();
    q=read();
    while(q--){
        m=read();ans=0;
        for(int i=1; i<=n; i++) x[i]=0;
        dfs(1,0);
        write(ans);putchar('\n');
    }
    return 0;
}