#include<iostream>
#include<cstdio>
#define N 100
#define M 10000
#define mod 1000000007
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int fast_pow(int a,int b)
{
    int res=1,mul=a;
    while (b)
    {
	if (b&1) res=1ll*res*mul%mod;
	mul=1ll*mul*mul%mod,b>>=1;
    }
    return res;
}
void Adder(int &x,int d)
{
    x+=d;
    if (x>=mod) x-=mod;
    return;
}
void Adder2(int &x,int d)
{
    x+=d;
    if (x<0) x+=mod;
    return;
}
int MD(int x)
{
    return x>=mod?x-mod:x;
}
int MD2(int x)
{
    return x<0?x+mod:x;
}
int T,n,q,k,x[N+1],y[N+1],tong[M+1],length;
int main()
{
    char c;
    int sx,res,rst,ps=0;
    T=read();
    if (T==1)
    {
	n=read();
	for (int i=1;i<=n;++i) x[i]=read(),y[i]=read();
	for (int i=1;i<=n;++i)
	{
	    res=0;
	    for (int j=1;j<=n;++j)
	    {
		rst=1;
		for (int k=1;k<=n;++k)
		{
		    if (x[j]<x[k]) rst=MD2(-1ll*rst*1ll*MD2(i-x[k])%mod*fast_pow(x[k]-x[j],mod-2)%mod);
		    if (x[j]>x[k]) rst=1ll*rst*MD2(i-x[k])%mod*fast_pow(x[j]-x[k],mod-2)%mod;
		}
		Adder(res,1ll*rst*y[j]%mod);
	    }
	    for (int i=0;i<=29;++i) tong[++length]=(res>>i)&1;
	}
	printf("%d\n",length);
	for (int i=1;i<=length;++i) printf("%d",tong[i]);
	puts("");
    }
    else
    {
	n=read(),q=read(),k=read();
	for (int i=1;i<=k;++i) cin>>c,tong[i]=c-'0';
	for (int i=1;i<=n;++i)
	{
	    res=0;
	    for (int j=0;j<=29;++j) res|=(tong[++ps]<<j);
	    y[i]=res;
	}
	while (q--)
	{
	    sx=read(),res=0;
	    for (int i=1;i<=n;++i)
	    {
		rst=1;
		for (int j=1;j<=n;++j)
		{
		    if (i<j) rst=MD2(-1ll*rst*1ll*MD2(sx-j)%mod*fast_pow(j-i,mod-2)%mod);
		    if (i>j) rst=1ll*rst*MD2(sx-j)%mod*fast_pow(i-j,mod-2)%mod;
		}
		Adder(res,1ll*rst*y[i]%mod);
	    }
	    printf("%d\n",res);
	}
    }
    return 0;
}