#include <bits/stdc++.h>
using namespace std;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

using ll = long long;
using P = pair<ll,ll>;
using graph = vector<vector<int>>;

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ll INF = 1LL<<60;
const ll mod = 1000000007LL;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main() {
  ll K,N,M;
  cin>>K>>N>>M;
  vector<ll> a(max(K,N)),c(K);
  rep(i,K) cin>>a[i];
  rep(i,K) cin>>c[i];
  for(int i = K;i<max(K,N);i++){
    rep(j,K){
      a[i] = (a[i]+a[i-j-1]*c[j])%mod;
    }
  }
  vector<ll> ans(N,0);
  rep(i,M){
    ll l,r;
    cin>>l>>r;
    for(int j = l; j < r; j++){
      ans[j] = (ans[j]+a[j-l])%mod;
    }
  }
  rep(i,N){
    printf("%lld\n",ans[i]);
  }
}