#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> v[100010],w[100010];
ll a[100010],c[100010],mod = 1000000007;
vector<ll> solve(vector<ll> &u){
    int i,k = u.size();
    vector<ll> ret(k);
    for(i=0;i<k - 1;i++) (ret[i] += u[i + 1]) %= mod;
    for(i=0;i<k;i++) (ret[k - 1] += c[k - 1 - i]*u[i]%mod) %= mod;
    return ret;
}

int main(){
    int i,j,k,n,m; cin >> k >> n >> m;
    for(i=0;i<k;i++) cin >> a[i];
    for(i=0;i<k;i++) cin >> c[i];
    for(i=0;i<k;i++) w[0].push_back(a[i]);
    for(i=1;i<=n;i++) w[i] = solve(w[i - 1]);
    for(i=0;i<=n;i++) v[i].resize(k);
    for(i=0;i<m;i++){
        int l,r; cin >> l >> r;
        for(j=0;j<k;j++){
            (v[l][j] += w[0][j]) %= mod; (v[r][j] += (mod - w[r - l][j])%mod) %= mod;
        }
    }
    for(i=0;i<n;i++){
        vector<ll> u = solve(v[i]);
        for(j=0;j<k;j++) (v[i + 1][j] += u[j]) %= mod;
    }
    for(i=0;i<n;i++) cout << v[i][0] << "\n";
}