A, B = map(int, input().split())
MOD = 10**9+7


def product(A, B, MOD):
    r = len(A)
    c = len(B[0])
    res = [[0]*c for _ in range(r)]
    for i in range(r):
        for j in range(c):
            for k in range(len(B)):
                res[i][j] += A[i][k]*B[k][j] % MOD
                res[i][j] %= MOD
    return res


X = [[A, B], [1, 0]]
L = [X]
for _ in range(60):
    L.append(product(L[-1], L[-1], MOD))

N = int(input())
ans = [0]*N
for i in range(N):
    T = int(input())
    C = [[1], [1]]
    for j in range(60):
        if (T >> (j+1)) & 1:
            C = product(L[j], C, MOD)
    x, y = C[0][0], C[1][0]
    if T & 1:
        ans[i] = (x+y+A*x+B*y) % MOD
    else:
        ans[i] = (x+y) % MOD

print(*ans, sep='\n')