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

#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=INF;
const ll MAX=100010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

//行列累乗
mat mul(mat &A,mat &B){
    mat C(A.size(),vec(B[0].size()));
    rep(i,A.size()){
        rep(j,B[0].size()){
            rep(k,B.size()){
                C[i][j]=(C[i][j]+(A[i][k]*B[k][j])%mod)%mod;
            }
        }
    }
    return C;
}
mat pow(mat A,ll k){
    mat B(A.size(),vec(A.size()));
    rep(i,A.size())B[i][i]=1;
    while(k>0){
        if(k&1)B=mul(B,A);
        A=mul(A,A);
        k>>=1;
    }
    return B;
}

void solve(){
    ll a,b;cin>>a>>b;
    vector<vector<ll> >c(3,vector<ll>(3));
    c[0][0]=a,c[0][1]=b,c[0][2]=1,c[1][0]=1;
    vector<vector<ll> >d(3,vector<ll>(3));
    d[0][0]=1,d[1][1]=1,d[2][0]=a,d[2][1]=b,d[2][2]=1;
    ll n;cin>>n;
    rep(i,n){
        ll t;cin>>t;
        ll x=t%2;
        ll y=t/2;
        auto z=pow(c,y);
        if(x){
            z=mul(d,z);
        }
        ll sum=0;
        rep(j,3){
            rep(k,2){
                sum=(sum+z[j][k])%mod;
            }
        }
        cout<<sum<<endl;
    }
}

signed main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    solve();
}