#include<cstdio>
#include<iostream>
#define RI register int
#define CI const int&
using namespace std;
const int N=1505,M=205,mod=1e9+7;
int n,m,q,p[N][M],b[M],f[N][M],ans[N][N],dp[N][M][M];
inline void inc(int& x,CI y)
{
    if ((x+=y)>=mod) x-=mod;
}
inline void solve(CI l,CI r)
{
    if (l==r)
    {
        for (RI i=0;i<=m;++i) inc(ans[l][l],1LL*p[l][i]*b[i]%mod);
        return;
    }
    int mid=l+r>>1; solve(l,mid); solve(mid+1,r);
    for (RI i=0;i<=m;++i) f[mid][i]=p[mid][i],f[mid+1][i]=p[mid+1][i];
    for (RI i=mid-1;i>=l;--i)
    {
        for (RI j=0;j<=m;++j) f[i][j]=0;
        for (RI j=0;j<=m;++j) for (RI k=0;j+k<=m;++j)
        inc(f[i][j+k],1LL*f[i+1][j]*p[i][k]%mod);
    }
    for (RI i=mid+2;i<=r;++i)
    {
        for (RI j=0;j<=m;++j) f[i][j]=0;
        for (RI j=0;j<=m;++j) for (RI k=0;j+k<=m;++j)
        inc(f[i][j+k],1LL*f[i-1][j]*p[i][k]%mod);
    }
    for (RI i=mid+1;i<=r;++i)
    {
        for (RI j=0;j<=m;++j) for (RI k=0;j+k<=m;++k)
        dp[i][j][k]=1LL*f[i][k]*b[j+k]%mod;
        for (RI j=0;j<=m;++j) for (RI k=1;j+k<=m;++k)
        inc(dp[i][j][k],dp[i][j][k-1]);
    }
    for (RI i=l;i<=mid;++i) for (RI j=mid+1;j<=r;++j)
    for (RI k=0;k<=m;++k) inc(ans[i][j],1LL*f[i][k]*dp[j][k][m-k]%mod);
}
int main()
{
    scanf("%d%d%d",&n,&m,&q);
    for (RI i=0;i<=m;++i) scanf("%d",&b[i]);
    for (RI i=1;i<=n;++i) for (RI j=0;j<=m;++j)
    scanf("%d",&p[i][j]),p[i][j]%=mod;
    for (solve(1,n);q;--q)
    {
        int l,r; scanf("%d%d",&l,&r);
        printf("%d\n",ans[l][r]);
    }
    return 0;
}