#include <bits/stdc++.h>
#define int long long
const int mod = 1e9 + 7;
using namespace std;
int n, m, q, b[300], p[2000][300], zero[300], pre[300][300], ipre[300][300], pre2[300][300];
int fp(int x, int k)
{
    if (!k)
        return 1;
    if (k & 1)
        return fp(x, k - 1) * x % mod;
    int tmp = fp(x, k >> 1);
    return tmp * tmp % mod;
}
int inv(int x)
{
    return fp(x, mod - 2);
}
void mul(int *a, int *b, int *c)
{
    for (int i = 0; i <= m; i++)
    {
        c[i] = 0;
        for (int j = 0; j <= m; j++)
        {
            c[i] += b[i] * a[i - j];
            c[i] %= mod;
        }
    }
}
void inv(int *a, int *b)
{
    b[0] = inv(a[0]);
    for (int i = 1; i <= m; i++)
    {
        b[i] = 0;
        for (int j = 0; j < i; j++)
        {
            b[i] += a[i - j] * b[j];
            b[i] %= mod;
        }
        b[i] = (mod - b[i]) * b[0] % mod;
    }
}
signed main()
{
    cin >> n >> m >> q;
    for (int i = 0; i <= m; i++)
    {
        cin >> b[m - i];
    }
    for (int i = 1; i <= n; i++)
    {
        bool sign = false;
        for (int j = 0; j <= m; j++)
        {
            int tmp;
            cin >> tmp;
            tmp %= mod;
            if (tmp)
                sign = true;
            if (sign)
            {
                p[i][j - zero[i]] = tmp;
            }
            else
            {
                zero[i]++;
            }
        }
        zero[i] += zero[i - 1];
    }
    ipre[0][0] = pre[0][0] = 1;
    for (int i = 1; i <= n; i++)
    {
        mul(pre[i - 1], p[i], pre[i]);
        inv(pre[i], ipre[i]);
        mul(pre[i], b, pre2[i]);
    }
    while (q--)
    {
        int l, r;
        cin >> l >> r;
        int ans = 0;
        for (int i = 0; i <= m - zero[r] + zero[l - 1]; i++)
        {
            ans += pre2[r][i] * ipre[l - 1][m - zero[r] + zero[l - 1] - i];
            ans %= mod;
        }
        cout << ans << endl;
    }
}