#include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<unordered_map>
#include<queue>
#include<vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define dump(o) {cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
const int MOD = 1e9 + 7;

signed main() {
	for (int m; cin >> m&&m;) {
		int dp[1001] = { 1 };
		//????????°???????????????????????\
		//rep(i, 0, m) {
		//	int a, b; cin >> a >> b;
		//	rep(k, 0, b) {
		//		rrep(j, 0, 1001 - a) {
		//			dp[j + a] += dp[j];
		//		}
		//	}
		//	dumpc(dp);
		//}
		//????????°???????????????????????\?????????
		rep(i, 0, m) {
			int a, b; cin >> a >> b;
			rrep(j, 0, 1001) {
				if (dp[j] == 0)continue;
				rep(k, 1, b + 1) {
					if (j + a*k > 1000)break;
					dp[j + a*k] += dp[j];
				}
			}
		}
		int g; cin >> g;
		rep(i, 0, g) {
			int n; cin >> n;
			cout << dp[n] << endl;
		}
	}
	return 0;
}