import sys
input = sys.stdin.readline

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


# 行列の計算（numpyを使えないとき,modを使用）
def prod(A,B,k,l,m):# A:k*l,B:l*m
    C=[[None for i in range(m)] for j in range(k)]

    for i in range(k):
        for j in range(m):
            ANS=0
            for pl in range(l):
                ANS=(ANS+A[i][pl]*B[pl][j])%mod

            C[i][j]=ANS

    return C

def plus(A,B,k,l):# a,B:k*l
    C=[[None for i in range(l)] for j in range(k)]

    for i in range(k):
        for j in range(l):
            C[i][j]=(A[i][j]+B[i][j])%mod

    return C

# 漸化式を行列累乗で求める（ダブリング）

POWA=[[[A,1],[B,0]]]

for i in range(65):
    POWA.append(prod(POWA[-1],POWA[-1],2,2,2)) # ベキを求めて


N=int(input())
for tests in range(N):
    t=int(input())

    n=t//2

    X=[[1,1]]
    while n:
        X=prod(X,POWA[n.bit_length()-1],1,2,2) # n乗の場合
        n-=1<<(n.bit_length()-1)

    if t%2==0:
        print(sum(X[0])%mod)
    else:
        X=X[0]
        print((X[0]+X[1]+X[0]*A+X[1]*B)%mod)