#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

int M, G, dp[2][1010];

signed main() {
    while(cin >> M, M) {
        memset(dp, 0, sizeof(dp));
        dp[0][0] = 1;

        rep(s,0,M) {
            int mo = s % 2;
            int a, b; cin >> a >> b;
            repq(k,0,b) {
                int cost = a * k;
                repq(i,0,1000) {
                    if(i-cost < 0) continue;
                    dp[mo^1][i] += dp[mo][i-cost];
                }
            }
            repq(i,0,1000) dp[mo][i] = 0;
        }

        cin >> G;
        rep(s,0,G) {
            int N; cin >> N;
            cout << dp[M%2][N] << endl;
        }
    }
    return 0;
}