#include<cstdio>
#define ll long long
#define maxn 1505
#define maxm 405
using namespace std;

const ll mod=1e9+7;
int n,m,q;
ll b[maxn],p[maxn][maxm],d[maxm];
ll A[maxm][maxm];
struct matrix
{
	int del;//偏移
	ll p[maxm],q[maxm],val[maxm];
	ll mul(ll x,ll y)
	{
		ll ret=1;
		while(y)
		{
			if(y&1)
			ret=ret*x%mod;
			x=x*x%mod;
			y>>=1;
		}
		return ret;
	}
	ll inv(ll x)
	{
		return mul(x,mod-2);
	}
	void inv()//上三角矩阵求逆
	{
		q[0]=inv(p[0]);
		for(int i=1;i<=m;++i)
		{
			ll ret=0;
			for(int j=0;j<i;++j)
			ret=(ret+p[i-j]*q[j]%mod)%mod;
			ret=(mod-ret)%mod;
			q[i]=inv(ret);
		}
		for(int i=0;i<=m;++i)
		for(int j=i;j<=m;++j)
		A[i][j]=q[j-i];
	}
	void getval()
	{
		for(int i=0;i<=m;++i)
		for(int j=0;j<=m;++j)
		val[i]=(val[i]+A[i][j]*b[j]%mod)%mod;
	}
}pre[maxn];

void getpre(ll a[],ll b[],ll c[])
{
	for(int i=0;i<=m;++i)
	c[i]=0;
	for(int i=0;i<=m;++i)
	for(int j=0;i+j<=m;++j)
	c[i+j]=(c[i+j]+a[i]*b[j]%mod)%mod;
}

int main()
{
	scanf("%d%d%d",&n,&m,&q);
	for(int i=0;i<=m;++i)
	scanf("%lld",&b[i]);
	for(int i=1;i<=n;++i)
	{
		for(int j=0;j<=m;++j)
		{
			scanf("%lld",&p[i][j]);
			p[i][j]%=mod;
		}
	}
	pre[0].p[0]=1;
	pre[0].inv();
	pre[0].getval();
	for(int i=1;i<=n;++i)
	{
		pre[i].del=pre[i-1].del;
		for(int j=0;j<=m;++j)
		{
			if(p[i][j]==0)
			pre[i].del++;
			else
			{
				for(int k=0;k<=m;++k)
				d[k]=0;
				for(int k=j;k<=m;++k)
				d[k-j]=p[i][k];
				break;
			}
		}
		getpre(pre[i-1].p,d,pre[i].p);
		pre[i].inv();
		pre[i].getval();
	}
	for(int i=1;i<=q;++i)
	{
		int l,r;
		scanf("%d%d",&l,&r);
		ll ans=0;
		int del=pre[r].del-pre[l-1].del;
		for(int i=0;i+del<=m;++i)
		ans=(ans+pre[r].p[i]*pre[l-1].val[i+del]%mod)%mod;
		printf("%lld\n",ans);
	}
	return 0;
}
/*
3 3 3
4 3 2 1
0 1 0 1000000007
0 500000004 0 500000004
0 0 500000004 500000004
1 1
1 2
1 3
*/