#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const int LOG = 60;
int main(){
  long long A, B;
  cin >> A >> B;
  vector<vector<vector<long long>>> dp(LOG, vector<vector<long long>>(2, vector<long long>(2, 0)));
  dp[0][0][0] = A;
  dp[0][0][1] = 1;
  dp[0][1][0] = B;
  dp[0][1][1] = 0;
  for (int i = 0; i < LOG - 1; i++){
    for (int j = 0; j < 2; j++){
      for (int k = 0; k < 2; k++){
        for (int l = 0; l < 2; l++){
          dp[i + 1][j][l] += dp[i][j][k] * dp[i][k][l];
          dp[i + 1][j][l] %= MOD;
        }
      }
    }
  }
  int N;
  cin >> N;
  for (int i = 0; i < N; i++){
    long long T;
    cin >> T;
    long long T2 = T / 2;
    vector<vector<long long>> dp2(2, vector<long long>(2, 0));
    dp2[0][0] = 1;
    dp2[1][1] = 1;
    for (int j = 0; j < LOG; j++){
      if ((T2 >> j & 1) == 1){
        vector<vector<long long>> dp3(2, vector<long long>(2, 0));
        for (int k = 0; k < 2; k++){
          for (int l = 0; l < 2; l++){
            for (int m = 0; m < 2; m++){
              dp3[k][m] += dp2[k][l] * dp[j][l][m];
              dp3[k][m] %= MOD;
            }
          }
        }
        swap(dp2, dp3);
      }
    }
    if (T % 2 == 0){
      cout << (dp2[0][0] + dp2[0][1] + dp2[1][0] + dp2[1][1]) % MOD << endl;
    } else {
      cout << ((dp2[0][0] + dp2[1][0]) * (A + 1) + (dp2[0][1] + dp2[1][1]) * (B + 1)) % MOD << endl;
    }
  }
}