#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}

#define MAX 7*100*10+10

signed main(void) {
    int n;
    while(cin >> n, n){
        int dp[10][MAX] = {};
        dp[0][0] = 1;
        rep(i,n){
            int a,b;
            cin >> a >> b;
            rep(j,MAX)if(dp[i][j] > 0){
                rep(k,b+1){
                    dp[i+1][j+a*k] += dp[i][j];
                }
            }
        }

        int g;
        cin >> g;
        rep(i,g){
            int m;
            cin >> m;
            cout << dp[n][m] << endl;
        }
    }
}

