#include<bits/stdc++.h>
using namespace std;

constexpr int mod = 1000000007;

vector<vector<long long>> Mul(vector<vector<long long>> A,vector<vector<long long>> B) {
    vector<vector<long long>>ans(A.size(),vector<long long>(A.size()));
    for(int i = 0; i < A.size(); i++) {
        for(int j = 0; j < A.size(); j++) {
            for(int k = 0; k < A.size(); k++) {
                ans[i][j] += A[i][k]*B[k][j]%mod;
                ans[i][j] %= mod;
            }
        }
    }
    return ans;
}

vector<vector<long long>> Pow(vector<vector<long long>> A,long long B) {
    vector<vector<long long>>ans(A.size(),vector<long long>(A.size()));
    for(int i = 0; i < A.size(); i++) {
        ans[i][i] = 1;
    }
    while (B) {
        if(1 & B) {
            ans = Mul(ans,A);
        }
        A = Mul(A,A);
        B /= 2;
    }
    return ans;
}

int main() {
    int A,B,N;
    cin >> A >> B >> N;
    vector<vector<long long>>S(2,vector<long long>(2));
    S[0][0] = A;
    S[0][1] = 1;
    S[1][0] = B;
    for(int i = 0; i < N; i++) {
        long long T;
        cin >> T;
        vector<vector<long long>>R = Pow(S,T/2);
        long long a = R[0][0]+R[1][0];
        long long b = R[0][1]+R[1][1];
        long long c = 0;
        if(T%2 == 1) {
            c = a*A+b*B;
        }
        cout << (a+b+c)%mod << endl;
    }
}