#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 1000000007
#define int ll
#define N 10000005 
using namespace std;
const int B=998244353;
const int coef1=16369;
const int coef2=103;
int t,x[N],y[N],a[N];
int f[N][3];
int n,q,L;
void BellaKira()
{
	cin>>t;
	if (t==1)
	{
		cin>>n;
		int nw=B;
		for (int i=1;i<=n;i++)
		{
			cin>>x[i]>>y[i];
			x[i]=(x[i]+nw)%mod;
			y[i]=(y[i]+nw)%mod;
			a[i*2-1]=x[i]%coef1;
			a[i*2]=y[i];
			nw=nw*1023%mod;
		}
		cout<<(30+14)*n<<'\n';
		// cout<<"??"<<a[1]<<'\n';
		for (int i=1;i<=2*n;i++) 
			if (i%2) cout<<bitset<14>(a[i]);
			else cout<<bitset<30>(a[i]);
		return;
	}
	cin>>n>>q>>L;
	int smx=0,smy=0;
	for (int i=1;i<=2*n;i++)
	{
		int nw=0;
		for (int j=1;j<=((i%2)?14:30);j++)
		{
			char ch;
			cin>>ch;
			nw=nw*2+ch-'0';
		}
		// cout<<"??"<<i<<" "<<nw<<'\n';
		if (i%2==0) y[i/2]=nw;
		else f[i/2+1][i%2]=nw;
	}	
	// for (int i=1;i<=n;i++) cout<<f[i][1]<<" "<<y[i]<<'\n';
	while (q--)
	{
		int o;
		cin>>o;
		int nw=B;
		bool bl=0;
		for (int i=1;i<=n;i++)
		{
			// cout<<(o+nw)%mod%coef1<<" "<<f[i][1]<<'\n';
			if ((o+nw)%mod%coef1==f[i][1])
			{
				cout<<(y[i]-nw+mod)%mod<<'\n';
				bl=1;
				break;
			}
			nw=nw*1023%mod;
		}
		assert(bl);
	}
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}