#include <bits/stdc++.h>
#define p pair<ll, ll>
#define x first
#define y second

using namespace std;
using ll = long long;

const int N = 2e5+5;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9+7;
const int BAZA = 69313;

int n;
int t;
p a[N];
vector<ll> k;
vector<ll> v;
int m, q;
string s;


ll add(ll x, ll y){
	if(x + y < 0) return x + y + MOD;
	else return (x + y) % MOD;
}
ll mul(ll x, ll y){
	return (x * y) % MOD;
}

ll pot(ll baza, ll exp){
	if(exp == 0) return 1;
	ll pol = pot(baza, exp / 2);
	if(exp % 2) return mul(baza, mul(pol, pol));
	return mul(pol, pol);
}

ll _div(ll x, ll y){
	return mul(x, pot(y, MOD - 2));
}

void mulk(ll tk){
	 v.insert(v.begin(), 0);
	 for(int i = 0; i < v.size() - 1; i++){
	 	cout << "x^" << i << ": ";
	 	cout << v[i] << " + " << v[i + 1] << " * " << -tk << " = " << add(v[i], mul(v[i + 1], -tk)) << "\n";
	 	v[i] = add(v[i], mul(v[i + 1], -tk));
	 }
}

void encode(){
	for(int i = 0; i < n; i++){
		cin >> a[i].x >> a[i].y;
	}
	for(int i = 0; i< n; i++){
		k.push_back(0);
	}
	for(int i = 0; i< n; i++){
		ll konst = 1;
		int ind = 0;
		if(i != n - 1) ind = i + 1;
		v.clear();
		v.push_back(-a[ind].x);
		v.push_back(1);
		
		cout << "v: \n";
		cout << 1 << " " << -a[ind].x << "\n";
		for(int j = 0; j < n; j++){
			if(i == j || j == ind) continue;
			mulk(a[j].x);
			for(int l = 0; l < v.size(); l++){
				cout << v[l] << " ";
			}
			cout << "\n";
			
		}
		cout << "-------\n";
		for(int j = 0; j < n; j++){
			if(i != j){
				konst = mul(add(a[i].x, - a[j].x), konst);
			}
		}
		cout << "here\n";
		konst = _div(a[i].y, konst);
		cout << "here\n";
		for(int j = 0; j < v.size(); j++){
			k[j] = add(k[j], mul(v[j], konst));
		}
		cout << "here\n";
	}
	for(int i = 0; i< n; i++){
		cout << k[i] << "\n";
	}
	int uk = 0;
	cout << n * 30 << "\n";
	for(int i = 0; i< n; i++){	
		for(int j = 0; j< 30; j++){	
			bool b = k[i] & (1 << j);
			cout << b;
		}
	}
}

ll calc(ll x){
	ll r = 0;
	for(int i = 0; i < n; i++){
		r = add(r, mul(k[i], pot(x, i)));
	}
	return r;
}

void decode(){
	cin >> q >> m;
	
	cin >> s;
	for(int i = 0; i<m / 30; i++){
		int tc = 1;
		int br = 0;
		for(int j = 0; j < 30; j++){
			bool b = s[i * 30 + j] - '0';
			br += b * tc;
			tc *= 2;
		}
		k.push_back(br);
	}
	for(int i = 0; i < q; i++){
		int b;
		cin >> b;
		cout << calc(b) << "\n";
	}
}

int main(){
	//ios_base::sync_with_stdio(false); cin.tie(NULL);
	
	cin >> t;
	cin >> n;
	if(t == 1) encode();
	else decode();
	return 0;
}