#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll K,N,M;
	cin>>K>>N>>M;
	vector<ll> A(N+1),C(K),base(K);
	rep(i,K) cin>>A[i],base[i]=A[i];
	rep(i,K) cin>>C[i];
	vector<ll> p(N+K+3);
	vector<vector<ll>> diff(K,vector<ll>(N+1));
	for(int i=K;i<=N;i++){
		rep(j,K){
			A[i]=(A[i]+(A[i-j-1]*C[j])%mod)%mod;
		}
	}
	diff[0]=A;
	for(int i=1;i<K;i++){
		rep(j,N){
			if(j-i>=0){
				diff[i][j]=(diff[i-1][j]-(C[i-1]*A[j-i])%mod)%mod;
			}
		}
	}
	for(int i=K-1;i>=0;i--){
		for(int j=i-1;j>=0;j--){
			base[i]=(base[i]-(A[j]*C[i-j-1])%mod)%mod;
		}
	}
	rep(i,M){
		int l,r;
		cin>>l>>r;
		rep(j,K) p[j+l]=(p[j+l]+base[j])%mod;
		rep(j,K) p[r+j]=(p[j+r]-diff[j][r+j-l])%mod;
	}
	rep(i,N){
		cout<<(p[i]+mod)%mod<<"\n";
		rep(j,K){
			p[i+j+1]=(p[i+j+1]+(p[i]*C[j])%mod)%mod;
		}
	}
	/*rep(i,K){
		rep(j,N) cout<<diff[i][j]<<" ";
		cout<<endl;
	}*/
}