import sys

input = sys.stdin.readline

N,M = map(int,input().split())
A = [0,0] + list(map(int,input().split()))
mod = 10**9+7

def calc(x,y,z=N):
    inv = (A[x]-A[y])*(A[y]-A[z])*(A[z]-A[x])
    tmp = (A[z]-A[x]) * (pow(A[z]-1,M-1,mod) - pow(A[y]-1,M-1,mod))
    tmp %= mod
    tmp += (A[y]-A[z]) * (pow(A[z]-1,M-1,mod) - pow(A[x]-1,M-1,mod))
    tmp %= mod
    tmp = (tmp * pow(inv,mod-2,mod)) % mod
    return tmp

Q = int(input())
query = [tuple(map(int,input().split())) for i in range(Q)]

t = [-1 for i in range(N+1)]
for i in range(Q):
    x,y = query[i]
    if y==N:
        t[x] = i+1
for i in range(2,N):
    if N%i==0:
        t[i] = 0

ans = [0 for i in range(Q+1)]

for i in range(2,N+1):
    for j in range(2,N//i+1):
        if t[i*j]!=-1:
            ans[t[i*j]] += calc(i,i*j)
            ans[t[i*j]] %= mod

for i in range(Q):
    x,y = query[i]
    if y!=N and t[y]!=-1:
        ans[max(i+1,t[y])] += calc(x,y)
        ans[max(i+1,t[y])] %= mod

for i in range(1,Q+1):
    ans[i] += ans[i-1]
    ans[i] %= mod

for i in range(Q+1):
    print(ans[i])