#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 100 + 5;
const int mod = 1e9 + 7;

inline void add_mod(int &a,int b){ a+=b; if(a>=mod) a-=mod;}

inline ll pw(ll a,ll b)
{
	ll res = 1;
	while(b)
	{
		if(b&1) res=res*a%mod;
		a=a*a%mod; b>>=1;
	}
	return res;
}

const int MAXF = MAXN * 2;
ll fac[MAXF], inv[MAXF];
inline ll C(int n,int m){ return n<0||m<0||n<m? 0: fac[n] * inv[m] %mod * inv[n-m] %mod;}

namespace P1
{
	const int MAXN = 100 + 5;
	
	void solve(void)
	{
		int n;
		scanf("%d",&n);
		vector<pii> p(n);
		for(auto &t: p)
			scanf("%d%d",&t.first,&t.second);
		
		vector<int> ans(n);
		
		vector<int> a(n+1);
		a[0] = 1;
		for(auto t: p)
		{
			for(int i=n; i>=1; --i)
				a[i] = ((ll)a[i] * (mod - t.first) + a[i-1]) %mod;
			a[0] = (ll)a[0] * (mod - t.first) %mod;
		}
		
		for(int k=0; k<n; ++k)
		{
			auto b = a;
			for(int i=n; i>=1; --i)
				b[i-1] = (b[i-1] - (ll)b[i] * (mod - p[k].first) %mod + mod) %mod;
			
			ll coef = 1;
			for(int i=0; i<n; ++i) if(i != k)
				coef = coef * (p[k].first - p[i].first + mod) %mod;
			coef = pw(coef, mod - 2) * p[k].second %mod;
			
			for(int i=1; i<=n; ++i)
				add_mod(ans[i-1], b[i] * coef %mod);
		}
		
		printf("ans: ");
		for(auto t: ans)
			printf("%d ",t);
		printf("\n");
		
		printf("%d\n",n * 30);
		for(int i=0; i<n; ++i)
		{
			for(int j=0; j<30; ++j)
				printf("%d",(ans[i] >> j) & 1);
		}
	}
}

namespace P2
{
	const int MAXD = 3e3 + 5;
	
	char s[MAXD];
	
	void solve(void)
	{
		int n,Q,d;
		scanf("%d%d%d%s",&n,&Q,&d,s);
		
		vector<int> a;
		for(int i=0; i<n; ++i)
		{
			int x = 0;
			for(int j=0; j<30; ++j)
				x |= (s[i * 30 + j] - '0') << j;
			a.emplace_back(x);
		}
		
		while(Q--)
		{
			int x;
			scanf("%d",&x);
			
			int ans = 0, cur = 1;
			for(auto t: a)
			{
				ans = (ans + (ll)cur * t) %mod;
				cur = (ll)cur * x %mod;
			}
			printf("%d\n",ans);
		}
	}
}

int main(void)
{
	fac[0] = 1;
	for(int i=1; i<MAXF; ++i)
		fac[i] = fac[i-1] * i %mod;
	inv[MAXF-1] = pw(fac[MAXF-1], mod-2);
	for(int i=MAXF-2; i>=0; --i)
		inv[i] = inv[i+1] * (i+1) %mod;
	
	int T;
	scanf("%d",&T);
	if(T == 1) P1 :: solve();
	else P2 :: solve();
	return 0;
}