MOD = 10**9 + 7

def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    K = int(input[idx]); idx +=1
    N = int(input[idx]); idx +=1
    M = int(input[idx]); idx +=1
    
    a = list(map(int, input[idx:idx+K]))
    idx +=K
    a = [aa % MOD for aa in a]
    c = list(map(int, input[idx:idx+K]))
    idx +=K
    c = [cc % MOD for cc in c]
    
    # Precompute a up to N-1
    for i in range(K, N):
        ai = 0
        for k in range(1, K+1):
            ai += c[k-1] * a[i -k]
            ai %= MOD
        a.append(ai % MOD)
    
    # Process all operations and accumulate into x
    x = [0] * (N)
    for _ in range(M):
        l = int(input[idx]); idx +=1
        r = int(input[idx]); idx +=1
        d = r - l
        for s in range(d):
            p = l + s
            if p >= N:
                break
            x[p] = (x[p] + a[s]) % MOD
    
    for xi in x:
        print(xi % MOD)
        
if __name__ == '__main__':
    main()