#include <iostream>
#include <vector>

template <int MOD>
struct ModInt {
    using lint = long long;
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt inv() const { return this->pow(MOD - 2); }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt pow(lint n) const {
        auto x = ModInt(1);
        auto b = *this;
        while (n > 0) {
            if (n & 1) x *= b;
            n >>= 1;
            b *= b;
        }
        return x;
    }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }

    // compare
    bool operator==(const ModInt& b) const { return val == b.val; }
    bool operator!=(const ModInt& b) const { return val != b.val; }
    bool operator<(const ModInt& b) const { return val < b.val; }
    bool operator<=(const ModInt& b) const { return val <= b.val; }
    bool operator>(const ModInt& b) const { return val > b.val; }
    bool operator>=(const ModInt& b) const { return val >= b.val; }

    // I/O
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept {
        lint v;
        is >> v;
        x = v;
        return is;
    }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

constexpr int MOD = 1000000007;
using mint = ModInt<MOD>;

void solve() {
    int k, n, q;
    std::cin >> k >> n >> q;

    std::vector<mint> xs(k, 0), cs(k);
    for (auto& x : xs) std::cin >> x;
    for (auto& c : cs) std::cin >> c;

    xs.resize(n + k + 1, 0);
    for (int i = k; i <= n + k; ++i) {
        for (int j = 0; j < k; ++j) {
            xs[i] += xs[i - j - 1] * cs[j];
        }
    }

    std::vector<std::vector<int>> qs(n + 1);
    while (q--) {
        int l, r;
        std::cin >> l >> r;
        qs[l].push_back(0);
        qs[r].push_back(r - l);
    }

    std::vector<mint> ans(n + k + 1, 0);
    for (int i = k; i <= n + k; ++i) {
        int l = i - k;
        for (auto s : qs[l]) {
            if (s == 0) {
                for (int j = 0; j < k; ++j) {
                    ans[l + j] += xs[s + j];
                }
            } else {
                for (int j = 0; j < k; ++j) {
                    ans[l + j] -= xs[s + j];
                }
            }
        }

        for (int j = 0; j < k; ++j) {
            ans[i] += ans[i - j - 1] * cs[j];
        }
    }

    for (int i = 0; i < n; ++i) std::cout << ans[i] << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}