#include <stdio.h>
#include <cctype>
#include <limits.h>
#include <math.h>
#include <complex>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>

#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(x) static_cast<bitset<16> >(x);
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define if_range(x, y, w, h) if (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))

const int INF = 1000000000;
typedef double D;
const double EPS = 1e-8;
const double PI = 3.14159;
int dx[4]={-1, 0, 1, 0}, dy[4]={0, -1, 0, 1};
using namespace std;
//typedef pair<int, int> P;

/** Problem0154 : Sum of Cards **/
int main()
{
	int N;
	while (cin>>N, N) {
		int c[7], num[7];
		rep(i, N) {
			cin>>c[i]>>num[i];
		}
		int dp[8][1001];
		memset(dp, 0, sizeof(dp));
		dp[0][0] = 1;
		
		for (int i=0; i<N; i++) {
			for (int j=0; j<=1000; j++) {
				for (int k=0; k<=num[i]; k++) {
					if (j+k*c[i]<=1000) {
						dp[i+1][j+k*c[i]] += dp[i][j];
					}
				}
			}
		}
		
		
		int G;
		cin>>G;
		rep(i, G) {
			int t; cin>>t;
			cout << dp[N][t] << endl;
		}
	}
}