#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int n,k,m;
ll a[200005],c[200005];
ll d[200005][205];
ll y[200005];
ll x[200005];

int main(void){
	scanf("%d%d%d",&k,&n,&m);
	for(int i=0;i<k;i++){
		scanf("%lld",&a[i]);
	}
	for(int i=1;i<=k;i++){
		scanf("%lld",&c[i]);
	}
	c[0]=-1;
	for(int i=k;i<=n;i++){
		ll sum=0;
		for(int j=1;j<=k;j++){
			sum+=a[i-j]*c[j]%MOD;
			sum%=MOD;
		}
		a[i]=sum;
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<k;j++){
			d[i][j]=c[j]*a[i-j]%MOD;
			if(d[i][j]<0){
				d[i][j]+=MOD;
			}
			d[i][j]%=MOD;
			if(j>0){
				d[i][j]+=d[i][j-1];
				d[i][j]%=MOD;
			}
		}
	}
	for(int i=0;i<m;i++){
		int l,r;
		scanf("%d%d",&l,&r);
		for(int j=l;j<min(l+k,n);j++){
			y[j]+=d[j-l][j-l];
			y[j]%=MOD;
		}
		for(int j=r;j<min(r+k,n);j++){
			y[j]+=MOD-d[j-l][j-r];
			y[j]%=MOD;
		}
	}
	for(int i=0;i<n;i++){
		x[i]=(MOD-y[i])%MOD;
		for(int j=1;j<min(i,k)+1;j++){
			x[i]+=c[j]*x[i-j]%MOD;
			x[i]%=MOD;
		}
		printf("%lld\n",x[i]);
	}
	return 0;
}