MOD = 10**9 + 7

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    ptr = 0
    K = int(data[ptr])
    ptr += 1
    N = int(data[ptr])
    ptr += 1
    M = int(data[ptr])
    ptr += 1

    a = list(map(int, data[ptr:ptr+K]))
    ptr += K
    c = list(map(int, data[ptr:ptr+K]))
    ptr += K

    # Precompute a up to maximum needed index
    max_needed = 0
    queries = []
    for _ in range(M):
        l = int(data[ptr])
        ptr += 1
        r = int(data[ptr])
        ptr += 1
        L = r - l
        queries.append((l, r))
        if L - 1 > max_needed:
            max_needed = L - 1

    # Extend the a array up to max_needed
    for _ in range(len(a), max_needed + 1):
        next_val = 0
        for k in range(1, K+1):
            if len(a) - k >= 0:
                next_val = (next_val + c[k-1] * a[len(a) - k]) % MOD
        a.append(next_val)

    # Initialize x array
    x = [0] * (N + 1)  # Using 1-based indexing for convenience

    # Process each query
    for l, r in queries:
        L = r - l
        # For each position in the query's range
        start = l
        end = min(r, N)
        length = end - start
        for d in range(length):
            if d > max_needed:
                break  # Since we precomputed up to max_needed, which is the maximum of all L-1
            x[start + d] = (x[start + d] + a[d]) % MOD

    # Output the result
    for i in range(N):
        print(x[i] % MOD)

if __name__ == "__main__":
    main()