#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
//using mint=modint998244353;
void chmax(ll&a,ll b){a=max(a,b);}
void chmin(ll&a,ll b){a=min(a,b);}
int main(){
  ll A,B,N;cin>>A>>B>>N;
  while(N--){
    ll T;cin>>T;
    vector<vector<mint>>a={{A,B},{1,0}},e={{1,0},{0,1}};
    ll n=T/2;
    while(n){
      if(n%2)e={{e[0][0]*a[0][0]+e[0][1]*a[1][0],e[0][0]*a[0][1]+e[0][1]*a[1][1]},{e[1][0]*a[0][0]+e[1][1]*a[1][0],e[1][0]*a[0][1]+e[1][1]*a[1][1]}};
      n/=2;
      a={{a[0][0]*a[0][0]+a[0][1]*a[1][0],a[0][0]*a[0][1]+a[0][1]*a[1][1]},{a[1][0]*a[0][0]+a[1][1]*a[1][0],a[1][0]*a[0][1]+a[1][1]*a[1][1]}};
    }
    if(T%2)cout<<((e[0][0]+e[0][1])*(A+1)+(e[1][0]+e[1][1])*(B+1)).val()<<endl;
    else cout<<(e[0][0]+e[0][1]+e[1][0]+e[1][1]).val()<<endl;
  }
  return 0;
}