import sys
#input = sys.stdin.readline #文字列につけてはダメ
#input = sys.stdin.buffer.readline #文字列につけてはダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
MOD = pow(10,9) + 7
#MOD = 998244353

def mat_dot(A, B, MOD=pow(10,9)+7):
  #A:n*m行列, B:m*l行列
  n, m, l = len(A), len(A[0]), len(B[0])
  X = [[0]*l for i in range(n)]
  for i in range(n):
    for j in range(l):
      temp = 0
      for k in range(m):
        temp = (temp + A[i][k] * B[k][j]) % MOD
      X[i][j] = temp
  return X
 
def mat_pow(A, x, MOD):
  #A^x
  n = len(A)
  X = [[0] * n for i in range(n)]
  for i in range(n):
    X[i][i] = 1
  for i in range(x.bit_length()):
    if (x>>i)&1:
      X = mat_dot(X, A, MOD)
    A = mat_dot(A, A, MOD)
  return X

def main():
    A,B = map(int,input().split())
    N = int(input())
    P = [[1,0,0],[0,1,0],[A,B,0]]
    Q = [[0,0,1],[1,0,0],[0,0,0]]
    R = mat_dot(Q,P)
    for _ in range(N):
        T = int(input())
        v = [[1],[1],[0]]
        X = mat_pow(R,T//2,MOD)
        if T%2 == 1:
            X = mat_dot(P,X,MOD)
        ans = mat_dot(X,v,MOD)
        print((ans[0][0]+ans[1][0]+ans[2][0])%MOD)



if __name__ == '__main__':
    main()