#include <bits/stdc++.h>
#define for_(i,a,b) for (int i = (a); i < (b); i++)
#define rep_(i,a,b) for (int i = (a); i <= (b); i++)
#define per_(i,a,b) for (int i = (a); i >= (b); i--)
#define pii pair<int, int>
#define pll pair<ll, ll> 
#define fi first
#define se second
#define ll long long
#define sz(a) (int)a.size()
#define all(v) v.begin(), v.end()
#define clr(x) memset(x, 0, sizeof(x))
#define ull unsigned long long
#define pb push_back
#define DEBUG(x) cerr << #x << '=' << x << endl
#define outarr(a,L,R) cerr<<#a"["<<L<<".."<<R<<"]=";rep_(_x,(L),(R))cerr<<a[_x]<<" "; cerr<<endl; 
	#ifdef LOCAL
#define line cout << "--------------------------------" << endl;
#define CE cout << endl;
#define CO cout << "OK" << endl;
#define D DEBUG
    #endif
#define endl '\n'
#define int long long
using namespace std;
bool be;clock_t startTime;
double getCurrentTime() {
	return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}
const int maxn = 2e5 + 10, mod = 998244353;// mod = 1949777;
const double EPS = 1e-3;
int n, m;
int a[maxn], b[maxn];
bool ed;

ll Get(int a, int b) {
	a %= mod;
	ll ans = 1; 
	while(b) {
		if (b & 1) ans = ans * a % mod;
		b >>= 1;
		a = a * a % mod;
	}
	return ans;
}
int c[105][105], d[105]; 
void Gaosi(int x) {
	if (x == n + 1) return;
	for (int i = x; i <= n; i++) {
		if (c[i][x]) {
			swap(c[i], c[x]);
			swap(b[i], b[x]);
			break;
		}
	}
	for (int i = 1; i <= n; i++) {
		if (i == x) continue;
		int inv = c[i][x] * Get(c[x][x], mod - 2) % mod;
		for (int j = 1; j <= n; j++) {
			c[i][j] = c[i][j] - inv * c[x][j] % mod;
			c[i][j] %= mod;
		}
		b[i] -= inv * b[x] % mod; b[i] %= mod;
	}
	Gaosi(x + 1);
	return;
}
void solve1() {
	cin >> n;
	rep_(i, 1, n) {
		cin >> a[i] >> b[i];
		rep_(j, 1, n) c[i][j] = Get(a[i], j);
	}
	Gaosi(1);
	cout << n * 30 << endl;
	rep_(i, 1, n) {
		b[i] = b[i] * Get(c[i][i], mod - 2) % mod;
		c[i][i] = 1;
		b[i] = (b[i] + mod) % mod;
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j <= 29; j++) {
			cout << (b[i] >> j & 1);
		}
	}
	cout << endl;
//	rep_(i, 1, n){
//		rep_(j, 1, n) {
//			cout << c[i][j] << ' ';
//		}
//		cout << b[i]; 
//		cout << endl;
//	}
}
int k;
void solve2() {
	cin >> n >> k >> m;
	rep_(i, 1, n) {
		char c;
		d[i] = 0;
		int p = 1;
		for (int j = 0; j <= 29; j++) {
			cin >> c;
			d[i] = d[i] + (c - '0') * p;
			p <<= 1;
		}
	}
	rep_(i, 1, k) {
		int x; cin >> x;
		int y = 0;
		rep_(j, 1, n) {
			y = y + Get(x, j) * d[j] % mod;
			y %= mod;
		}
		cout << y << endl;
	}
}
signed main() {
	#ifdef LOCAL
		freopen("w.in", "r", stdin);
//		freopen("w.out", "w", stdout);
		startTime = clock();
//		time_t now_time = time(NULL); tm* TuT = localtime(&now_time); cout << asctime(TuT); cout << "CodeBegin:_______________________" << endl;
//		cout << "Memory footprint:" << ((&be - &ed) >> 20) <<"MB"<< endl;
//		line;
	#endif
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
  //int tt; cin >> tt; while(tt--) solve();
  	int T;
  	cin >> T;
  	if (T == 1) {
  		solve1();
	  } 
	else
	solve2();
  	#ifdef LOCAL
  	cerr<<"\n\n-----------------------\nProgram done in "<<clock()-startTime<<" ms";
	#endif
 	return 0; 
}
//by whc
// check if over int , and open long long !!!

//