#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>    // 包含 tree、gp_hash_table、cc_hash_table
#include <ext/pb_ds/priority_queue.hpp> // 引入后使用 STL 的堆需要 std::
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;
template<typename key, typename val = null_type, typename cmp = less<>>
using rb_tree = tree<key, val, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<typename key, typename cmp = less<>>
using pairing_heap = __gnu_pbds::priority_queue<key, cmp>;
typedef long long ll;
#define int long long
mt19937_64 rd(time(0));

const int mod = 1e9 + 7;

auto binpow = [](int a, int b, int res = 1) {
    for (a %= mod; b; b >>= 1, (a *= a) %= mod) {
        if (b & 1) (res *= a) %= mod;
    }
    return res;
};

void QAQ() {
    int n, m, q;
    cin >> n >> m >> q;

    vector<int> b(m + 1);

    for (int i = 0; i <= m; i++) {
        cin >> b[i];
    }

    vector p(n + 1, vector<array<int, 2>>(2 * m + 1)), dp(n + 1, vector<array<int, 2>>(2 * m + 1)), zero(n + 1, vector<array<int, 2>>(2 * m + 1));

    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= m; j++) {
            cin >> p[i][j][0];
            if (p[i][j][0] == mod) {
                p[i][j] = {0, 1};
            }
        }
    }

    auto jia = [&](array<int, 2> & a, array<int, 2> & b) -> array<int, 2> {
        int t = min(a[1], b[1]);
        if (a[0] + b[0] == mod) {
            t++;
        }
        return array<int, 2>{(a[0] + b[0]) % mod, t};
    };

    auto mul = [&](array<int, 2> & a, array<int, 2> & b) -> array<int, 2> {
        return array<int, 2>{a[0] * b[0] % mod, a[1] * b[1]};
    };

    auto div = [&](array<int, 2> & a, array<int, 2> & b) {
        return array<int, 2>{a[0] * binpow(b[0], mod - 2) % mod, a[1] - b[1]};
    };

    dp[0][0] = {1, 0};

    for (int i  = 1; i <= n ; i++)
        for (int j = 0 ; j <= 2 * m; j++)
            for (int k = 0; k <= j; k++) {
                    auto tmp = mul(dp[i - 1][j - k], p[i][k]);
                    dp[i][j] = jia(dp[i][j], tmp);
                }

    while (q--) {
        int l, r;
        cin >> l >> r;

        int ans = 0;

        for (int j = 0; j <= 2 * m; j++) {
            for (int i = 0; i <= j; i++) {
                if (j - i > m) {
                    continue;
                }
                auto tmp = div(dp[r][j], dp[l - 1][i]);
                int tt = tmp[1] ? 0 : tmp[0];
                (ans += tt * b[j - i]) %= mod;
            }
        }

        cout << ans << "\n";
    }
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int t = 1;
    // cin >> t;

    while (t--) {
        QAQ();
    }
}