#include <bits/extc++.h>

#ifdef LOCAL
#include "dump.h"
#else
#define DUMP(...) (void)0
#endif

using namespace std;

template <class T, class Op = multiplies<T>>
constexpr T power(T a, long long n, Op op = Op(), T e = {1}) {
  assert(n >= 0);
  while (n) {
    if (n & 1) e = op(e, a);
    if (n >>= 1) a = op(a, a);
  }
  return e;
}

template <unsigned M>
struct modular {
  using m = modular;
  static constexpr unsigned mod = M;
  unsigned v;
  modular(long long x = 0) : v((x %= mod) < 0 ? x + mod : x) {}
  m operator-() const { return m() -= *this; }
  m& operator+=(m b) {
    if ((int)(v += b.v - mod) < 0) v += mod;
    return *this;
  }
  m& operator-=(m b) {
    if ((int)(v -= b.v) < 0) v += mod;
    return *this;
  }
  m& operator*=(m b) {
    v = (uint64_t)v * b.v % mod;
    return *this;
  }
  m& operator/=(m b) { return *this *= power(b, mod - 2); }
  friend m operator+(m a, m b) { return a += b; }
  friend m operator-(m a, m b) { return a -= b; }
  friend m operator*(m a, m b) { return a *= b; }
  friend m operator/(m a, m b) { return a /= b; }
  friend bool operator==(m a, m b) { return a.v == b.v; }
};

using mint = modular<power(10, 9) + 7>;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int k, n, m;
  cin >> k >> n >> m;
  vector<mint> a(k);
  for (auto&& e : a) cin >> e.v;
  vector<mint> c(k + 1);
  c[0] = 1;
  for (int i = 1; i <= k; ++i) {
    cin >> c[i].v;
    c[i] = -c[i];
  }
  a.resize(n + k + 1);
  for (int i = k; i <= n + k; ++i) {
    for (int j = 1; j <= k; ++j) {
      a[i] -= c[j] * a[i - j];
    }
  }
  DUMP(a);
  vector<vector<mint>> b(n);
  vector<mint> cur(2 * k + 1);
  for (int i = 0; i < k; ++i) {
    for (int j = 0; j <= k; ++j) {
      cur[i + j] += a[i] * c[j];
    }
  }
  for (int i = 0; i < n; ++i) {
    b[i].resize(k);
    for (int j = 0; j < k; ++j) {
      b[i][j] = cur[j];
    }
    for (int j = 0; j <= k; ++j) {
      cur[j] -= a[i] * c[j];
    }
    for (int j = 0; j < 2 * k; ++j) {
      cur[j] = cur[j + 1];
    }
    for (int j = 0; j <= k; ++j) {
      cur[j + k - 1] += a[i + k] * c[j];
    }
  }
  vector<mint> d(n + k + 1);
  while (m--) {
    int l, r;
    cin >> l >> r;
    for (int i = 0; i < k; ++i) {
      d[l + i] += b[0][i];
      if (r < n) d[r + i] -= b[r - l][i];
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 1; j <= min(k, i); ++j) {
      d[i] -= c[j] * d[i - j];
    }
    cout << d[i].v << '\n';
  }
}