//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const int mod = 1000000007;
//const int mod = 998244353;

struct mint {
  int64_t x;
  mint(int64_t x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(int64_t t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }

  //for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) {return mint(*this) /= a;}
};

istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}

#define K 210
#define M 100010

//head

int k, n, m;
mint a[M], c[K];
P lr[M];
mint x[M], xx[M];
PQG<P> q1, q2;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> k >> n >> m;
  rep(i, k) cin >> a[i];
  rep(i, k) cin >> c[i];
  rep(i, m) cin >> lr[i];
  rep(i, n-k) {
    rep(j, k) {
      a[i+k] += c[j] * a[i+k-j-1];
    }
  }
  sort(lr, lr+m);
  int sh = 0;
  rep(i, n+1) {
    while(!q1.empty() and q1.top().first == i) {
      int now = q1.top().second;
      q1.pop();
      if(lr[now].second == i) {
        for(int j = lr[now].first; j < i; j++) {
          xx[j] += a[j-lr[now].first];
        }
        continue;
      }
      for(int j = lr[now].first; j < i; j++) {
        x[j] += a[j-lr[now].first];
      }
      q2.emplace(lr[now].second, now);
    }
    if(i == n) break;
    if(i >= k) rep(j, k) {
      x[i] += c[j] * x[i-j-1];
    }
    while(!q2.empty() and q2.top().first == i) {
      int now = q2.top().second;
      q2.pop();
      int l, r;
      tie(l, r) = lr[now];
      x[r] -= a[r-l];
      for(int j = r-k; j < r; j++) {
        x[j] -= a[j-l];
        xx[j] += a[j-l];
      }
    }
    while(sh != m and lr[sh].first == i) {
      q1.emplace(min(i+k, lr[sh].second), sh);
      sh++;
    }
  }

  rep(i, n) cout << x[i]+xx[i] << '\n';
}