#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
// #define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
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 (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

ll dp[100001][201];


signed main() {
    fio();

    int k, n, m;
    cin >> k >> n >> m;

    vl a(k), c(k + 1, -1);
    rep (i, k) cin >> a[i];
    rep1 (i, k) cin >> c[i];

    for (int i = k; i < n; i++) {
        a.push_back(0);
        for (int j = 1; j <= k; j++) {
            a[i] += c[j] * a[i - j];
            a[i] %= MOD;
        }
    }

    for (int i = 0; i < n; i++) {
        dp[i][0] = c[0] * a[i] % MOD;
        for (int j = 1; j <= k; j++) {
            if (i - j < 0) break;
            dp[i][j] = (dp[i][j - 1] + c[j] * a[i - j]) % MOD;
        }
    }

    // rep (i, n) {
    //     rep (j, k + 1) {
    //         cout << dp[i][j] << " ";
    //     }
    //     cout << endl;
    // }

    // DEBUG_VEC(a);
    vl y(n);

    while (m--) {
        int l, r;
        cin >> l >> r;
        for (int i = l; i < min(l + k, n); i++) {
            y[i] += dp[i - l][i - l];
            y[i] %= MOD;
        }
        // vl x(n);
        // x[0] = c[0] * y[0];
        // for (int i = 1; i < n; i++) {
        //     for (int j = 1; j <= min(k, i); j++) {
        //         x[i] += c[j] * x[i - j];
        //     }
        //     x[i] -= y[i];
        // }
        // DEBUG_VEC(x);
        for (int i = r; i < min(r + k, n); i++) {
            y[i] -= dp[i - l][i - r];
            y[i] %= MOD;
        }

        // DEBUG_VEC(y);
        // // vl x(n);
        // fill(all(x), 0);
        // x[0] = c[0] * y[0];
        // for (int i = 1; i < n; i++) {
        //     for (int j = 1; j <= min(k, i); j++) {
        //         x[i] += c[j] * x[i - j];
        //     }
        //     x[i] -= y[i];
        // }
        // DEBUG_VEC(x);
    }

    vl x(n);
    x[0] = c[0] * y[0] % MOD;
    for (int i = 1; i < n; i++) {
        for (int j = 1; j <= min(k, i); j++) {
            x[i] += c[j] * x[i - j] % MOD;
        }
        x[i] -= y[i];
        x[i] %= MOD;
    }

    rep (i, n) {
        cout << (x[i] + MOD) % MOD << endl;
    }
}