//vanitas vanitatum et omnia
#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128; 
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}      
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii; 
typedef vector<int> vi;  
typedef vector<pii> vp; 
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=1e5+5,mod=1e9+7;
int k,n,m,a[N],c[N],d[N];
vi p[N],q[N];

signed main() {
  k=read(), n=read(), m=read();
  rep(i,0,k-1) a[i]=read();
  rep(i,1,k) c[i]=read();
  rep(i,k,n) rep(j,1,k) a[i]=(a[i]+a[i-j]*c[j])%mod;
  rep(i,1,m) {
    int l=read()+1, r=read();
    p[l].eb(r), q[r].eb(l);
  }
  rep(i,1,n) {
    if(i>=k) {
      int x=i-k;
      for(int r:p[x]) if(r>=i) {
        rep(p,0,k-1) d[x+p]=(d[x+p]+a[p])%mod;
      }
    }
    int res=0;
    rep(j,0,k-1) if(i-j>0) {
      for(int r:p[i-j]) if(r>=i) res=(res+a[j])%mod;
    }
    rep(j,1,k) if(i-j>=0) d[i]=(d[i]+d[i-j]*c[j])%mod;
    printf("%lld\n",(d[i]+res)%mod);
    for(int l:q[i]) if(i-l>=k) {
      int x=i-l;
      rep(j,0,k-1) d[i-j]=(d[i-j]+mod-a[x-j])%mod;
    }
  }
  return 0;
}