#include "bits/stdc++.h"

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pii;

#define all(x) x.begin(), x.end()
#define sz(x) ((int) ((x).size()))
#define pb push_back
#define F first
#define S second
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

const int MOD = 1e9 + 7;

ll potM(ll x, ll k) { if (k == 0) return 1; ll a = potM(x, k / 2); if (k % 2 == 0) { return (a * a) % MOD; } else { return ((a * a) % MOD * x) % MOD; }}
ll addM(ll a, ll b) { return a + b >= MOD ? a + b - MOD : a + b; }
ll subM(ll a, ll b) { return addM(a, MOD-b); }
ll mulM(ll a, ll b) { return a * b % MOD; }
ll divM(ll a, ll b) { return mulM(a, potM(b, MOD - 2)); }

int n;
vector<pii> t;
vector<ll> pol;
vector<ll> k;

void mul(int x) {
	vector<ll> mp;

	for (int i = 0; i < sz(pol); i++) {
		mp.pb(mulM(pol[i], MOD-x));
	}

	for (int i = 1; i < sz(mp); i++) {
		pol[i - 1] = addM(pol[i - 1], mp[i]);
	}

	pol.insert(pol.begin(), mp[0]);
}

void calcPol() {
	pol.clear();
	pol.pb(1);

	for (int i = 0; i < n - 1; i++) {
		mul(t[i].F);
	}

	ll d = 1;

	for (int i = 0; i < n - 1; i++) {
		d = mulM(d, subM(t[n - 1].F, t[i].F));
	}

	for (int i = 0; i < n; i++) {
		pol[i] = divM(mulM(t[n - 1].S, pol[i]), d);
	}
}

void comp() {
	cin >> n;
       cout << "HELLO" << endl;

	for (int i = 0; i < n; i++) {
		int x, y;
		cin >> x >> y;
		
		t.pb({x, y});
	}

	k.resize(n);

	for (int i = 0; i < n; i++) {
		calcPol();

		for (int j = 0; j < n; j++) {
			k[j] = addM(pol[j], k[j]);
		}

		t.insert(t.begin(), t[n - 1]);
		t.erase(prev(t.end()));
	}

	string s;
	
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 30; j++) {
			if (k[i] & (1 << j)) {
				s.pb('1');
			} else {
				s.pb('0');
			}
		}
	}

	cout << sz(s) << endl;
	cout << s << endl;
}

int q, b;
string s;

void read() {
	cin >> n >> q >> b;

	cin >> s;

	for (int i = 0; i < n; i++) {
		ll cur = 0;
		
		for (int j = 0; j < 30; j++) {
			if (s[i * 30 + j] == '1') {
				cur |= 1 << j;
			}
		}

		k.pb(cur);
	}

	for (int i = 0; i < q; i++) {
		ll sum = 0;
		ll x;
		cin >> x;

		for (int j = 0; j < n; j++) {
			sum = addM(sum, mulM(potM(x, j), k[j]));
		}	
	
		cout << sum << endl;
	}
}

int main() {
	FIO;
	int m;
	cin >> m;

	if (m == 1) {
		comp();
	} else {
		read();
	}

	return 0;
}