#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <utility>
#include <algorithm>
#include <numeric>
#include <typeinfo>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <ctime>

using namespace std;

#define dump(n) cout<<"# "<<#n<<"="<<(n)<<endl
#define debug(n) cout<<__FILE__<<","<<__LINE__<<": #"<<#n<<"="<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
#define iter(c) __typeof((c).begin())
#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();i++)
#define allof(c) (c).begin(),(c).end()
#define mp make_pair

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;

void solve(const vi& a,const vi& b,int p,int sum,vi& c)
{
	if(p==a.size())
		c[sum]++;
	else
		rep(i,b[p]+1)
			solve(a,b,p+1,sum+a[p]*i,c);
}

int main()
{
	for(int m;cin>>m,m;){
		vi a(m),b(m);
		rep(i,m)
			cin>>a[i]>>b[i];

		vi c(7001);
		solve(a,b,0,0,c);
		int g; cin>>g;
		rep(i,g){
			int n; cin>>n;
			cout<<c[n]<<endl;
		}
	}
	
	return 0;
}