#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  lint K, N, M;
  cin >> K >> N >> M;
  vector<lint> a(N);
  REP(i, K) cin >> a[i];
  vector<lint> c(K);
  REP(i, K) cin >> c[i];
  FOR(i, K, N) REP(j, K) a[i] = (a[i] + c[j]*a[i-1-j] % MOD) % MOD;
  vector<lint> eventl(N);
  vector<vector<lint>> eventr(N);
  REP(i, M) {
    lint l, r;
    cin >> l >> r;
    r--;
    eventl[l]++;
    eventr[r].push_back(r-l);
  }
  vector<lint> cnt(K);
  vector<lint> as(K);
  REP(i, N) {
    REP(j, K) as[j] = (as[j] + cnt[K-1]*a[j] % MOD) % MOD;
    lint asnext = 0;
    REP(j, K) asnext = (asnext + c[j]*as[K-1-j] % MOD) % MOD;
    REP(j, K-1) as[j] = as[j+1];
    as[K-1] = asnext;
    IREP(j, K-1) cnt[j+1] = cnt[j];
    cnt[0] = eventl[i];
    lint ans = as[K-1];
    REP(j, K) ans = (ans + a[j]*cnt[j] % MOD) % MOD;
    cout << ans << "\n";
    REP(j, eventr[i].size()) {
      if(eventr[i][j] < K) {
        cnt[eventr[i][j]]--;
      } else {
        REP(k, K) {
          as[K-1-k] = (as[K-1-k] - a[eventr[i][j]-k] + MOD) % MOD;
        }
      }
    }
  }
}