#include <bits/stdc++.h>

#define LL long long
#define VI vector<int>
#define VVI vector<vector<int>>
#define VVVI vector<vector<vector<int>>>
#define VB vector<bool>
#define VL vector<long long>
#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EPS 1e-14

const std::string YES = "YES";
const std::string Yes = "Yes";
const std::string NO = "NO";
const std::string No = "No";

bool inside(int y, int x, int H, int W) { return 0 <= y && y < H && 0 <= x && x < W; }

// 4近傍（右, 下, 左, 上）
const std::vector<int> dy = { 0, -1, 0, 1 };
const std::vector<int> dx = { 1, 0, -1, 0 };

using namespace std;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    while (true) {
        int m;
        cin >> m;
        if (m == 0) { break; }
        vector<int> A(m), B(m);
        FOR(i, 0, m) {
            cin >> A[i] >> B[i];
        }

        vector<int> dp(1001, 0);
        dp[0] = 1;
        FOR(i, 0, m) {
            for(int j = 1000; j >= 0; --j){
                FOR(k, 1, B[i] + 1) {
                    int c = j + A[i] * k;
                    if(c <= 1000) {
                        dp[c] += dp[j];
                    }
                }
            }
        }

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


    return 0;
}
