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

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

import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

mod = 10**9+7

def main():

    a, b = map(int, input().split())
    n = int(input())
    X0 = [1, 1, 0]
    X1 = [1, 1, a+b]
    for i in range(n):
        t = int(input())
        if t%2 == 0:
            t //= 2
            A = [[a, b, 0], [1, 0, 0], [0, 0, 0]]
            A = mat_pow(A, t, mod)
            ans = 0
            for i in range(3):
                for j in range(3):
                    ans += A[i][j]*X0[j]
                    ans %= mod
            print(ans)
        else:
            t //= 2
            A = [[0, 0, 1], [1, 0, 0], [b, 0, a]]
            A = mat_pow(A, t, mod)
            ans = 0
            for i in range(3):
                for j in range(3):
                    ans += A[i][j]*X1[j]
                    ans %= mod
            print(ans)
if __name__ == '__main__':
    main()