#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int mod = 1e9 + 7;
int norm(int x) { return x >= mod ? x - mod : x; }
int reduce(int x) { return x < 0 ? x + mod : x; }
int neg(int x) { return x ? mod - x : 0; }
int quo2(int x) { return (x + (x & 1 ? mod : 0)) >> 1; }
void add(int &x, int y) { x += y, x = x >= mod ? x - mod : x; }
void sub(int &x, int y) { x -= y, x = x < 0 ? x + mod : x; }
void fam(int &x, int y, int z) { x = (x + (ll)y * z) % mod; }
int mpow(int a, int b) {
  int ret = 1;
  for (; b; b >>= 1) {
    if (b & 1) ret = (ll)ret * a % mod;
    a = (ll)a * a % mod;
  }
  return ret;
}

int main() {
  int n, m, q; scanf("%d%d%d", &n, &m, &q);
  vector<int> b(m + 1);
  for (int i = m; i >= 0; --i) scanf("%d", b.data() + i);
  vector<vector<int>> a(n, vector<int>(m + 1));
  for (int i = 0; i < n; ++i)
    for (int j = 0; j <= m; ++j) scanf("%d", a[i].data() + j);
  vector<int> ans(q);
  vector<tuple<int, int, int>> qry;
  for (int i = 0; i < q; ++i) {
    int l, r; scanf("%d%d", &l, &r), --l, qry.emplace_back(l, r, i);
  }
  auto divideConquer = [&](auto &self, int l, int r, vector<tuple<int, int, int>> qry) {
    if (qry.empty()) return ;
    if (l + 1 == r) {
      int s = 0;
      for (int i = 0; i <= m; ++i) fam(s, a[l][i], b[m - i]);
      for (auto [ql, qr, i] : qry) ans[i] = s;
      return ;
    }
    int mid = (l + r + 1) >> 1;
    vector<vector<int>> f(r - l + 1, vector<int>(m + 1));
    f[mid][0] = 1;
    for (int i = mid; i < r; ++i)
      for (int j = 0; j <= m; ++j)
        for (int k = 0; j + k <= m; ++k)
          fam(f[i - l + 1][j + k], f[i - l][j], a[i][k]);
    f[mid] = b;
    for (int i = mid - 1; i >= l; --i)
      for (int j = 0; j <= m; ++j)
        for (int k = 0; j + k <= m; ++k)
          fam(f[i - l][j + k], f[i - l + 1][j], a[i][k]);
    vector<tuple<int, int, int>> L, R;
    for (auto [ql, qr, i] : qry)
      if (qr <= mid) L.emplace_back(ql, qr, i);
      else if (ql >= mid) R.emplace_back(ql, qr, i);
      else for (int j = 0; j <= m; ++j) fam(ans[i], f[ql - l][j], f[qr - l][m - j]);
    self(self, l, mid, L), self(self, mid, r, R);
  };
  divideConquer(divideConquer, 0, n, qry);
  for (int i = 0; i < q; ++i) printf("%d\n", ans[i]);
}