def mulmod(a,b,mod):
    return a*b%mod
def mat_mul_Pypy(A,B):
    return [[sum([mulmod(A[i][k],B[k][j],MOD) for k in range(len(B))])%MOD for j in range(len(B[0]))] for i in range(len(A))]

def mat_power_Pypy(A, N):#行列累乗
    P = [[1 if i==j else 0 for i in range(len(A[0]))] for j in range(len(A))]
    while N:
        if N & 1:
            P = mat_mul_Pypy(P, A)
        A = mat_mul_Pypy(A, A)
        N >>= 1
    return P
MOD = 10 ** 9 + 7
A,B = map(int,input().split())
N = int(input())
ANS = []
def solve(t):
    M = [[A,B],[1,0]]
    tmp = mat_power_Pypy(M,t//2)
    board = mat_mul_Pypy(tmp,[[1],[1]])
    if t % 2 == 0:
        return (board[0][0] + board[1][0]) % MOD
    else:
        return (board[0][0] * (A+1) + board[1][0] * (B+1)) % MOD
for _ in range(N):
    t = int(input())
    ANS.append(solve(t))
print(*ANS,sep='\n')