import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
mod = 10 ** 9 + 7


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


def mat_pow(A, n):
    size = len(A)
    res = [[0] * size for _ in range(size)]
    for i in range(size):
        res[i][i] = 1
    while n:
        if n & 1:
            res = mat_mul(res, A)
        A = mat_mul(A, A)
        n >>= 1
    return res


def test(A, B, T):
    X = [
        [1, 0, 0],
        [0, 1, 0],
        [A, B, 1],
    ]

    Y = [
        [0, 0, 1],
        [1, 0, 0],
        [0, 0, 0],
    ]

    XY = mat_mul(Y, X)

    d, m = divmod(T, 2)
    P = mat_pow(XY, d)
    if m:
        P = mat_mul(X, P)
    res = P[0][0] + P[0][1] + P[1][0] + P[1][1] + P[2][0] + P[2][1]
    return res % mod


A, B = map(int, input().split())
N = int(input())
for _ in range(N):
    T = int(input())
    print(test(A, B, T))