#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;

const int MOD=1000000007;

vector<vector<ll>> matrixmul(ll m,vector<vector<ll>> a,vector<vector<ll>> b){
  vector<vector<ll>> c(m,vector<ll>(m,0));
  rep(i,m) rep(j,m) rep(k,m) c[i][j]=(c[i][j]+a[i][k]*b[k][j]%MOD)%MOD;
  return c;
}

vector<vector<ll>> matrixpow(ll m,vector<vector<ll>> vec,ll n){
  vector<vector<ll>> ans(m,vector<ll>(m,0));
  rep(i,m) ans[i][i]=1;
  while(n){
    if(n&1) ans=matrixmul(m,ans,vec);
    vec=matrixmul(m,vec,vec);
    n>>=1;
  }
  return ans;
}
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  ll a,b;
  cin>>a>>b;
  int n;
  cin>>n;
  while(n--){
    ll t;
    cin>>t;
    vector<vector<ll>> A(3,vector<ll> (3));
    A[0][0]=a,A[0][1]=b,A[1][0]=1;
    vector<vector<ll>> B=matrixpow(3,A,t/2);
    ll r=B[0][0]+B[0][1],g=B[1][0]+B[1][1],bb=B[2][0]+B[2][1];
    if(t%2==0) cout<<(r+g+bb)%MOD<<endl;
    else cout<<((a+1)*r%MOD+(b+1)*g%MOD)%MOD<<endl;;
  }
  
  return 0;
}