#include <math.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, l, n) for (int i = (l); i < (n); i++)
#define ite(i, a) for(auto& i : a)
#define all(x) x.begin(), x.end()
#define lb lower_bound
#define ub upper_bound
#define lbi(A, x) (ll)(lb(all(A), x) - A.begin())
#define ubi(A, x) (ll)(ub(all(A), x) - A.begin())
using ll = long long;
using Pair = pair<int, int>;
template <class T>	using V = vector<T>;
template <class T>	using VV = V<V<T> >;
const ll INF = 1000000000000000001;
const int inf = 1001001001;
const ll mod = 1000000007;
const ll MOD = 998244353;
template <class T>  inline V<T> getList(int n) { V<T> res(n); rep(i, 0, n) { cin >> res[i]; }return res; }
template <class T>  inline VV<T> getGrid(int m, int n) { VV<T> res(m, V<T>(n)); rep(i, 0, m) { res[i] = getList<T>(n); }return res; }
inline V<int> dtois(string& s) { V<int> vec = {}; for (auto& e : s) { vec.push_back(e - '0'); } return vec; }

VV<ll> prod_mat(VV<ll>& A, VV<ll>& B) {
	VV<ll> res = { {0,0},{0,0} };
	rep(i, 0, 2) {
		rep(j, 0, 2) {
			rep(k, 0, 2) {
				res[i][j] += A[i][k] * B[k][j] % mod;
				res[i][j] %= mod;
			}
		}
	}
	return res;
}

VV<ll> exp_mat(VV<ll> A, ll n) {
	VV<ll> res = { {1,0},{0,1} };
	while (n) {
		if (n & 1) {
			res = prod_mat(A, res);
		}
		A = prod_mat(A, A);
		n >>= 1;
	}
	return res;
}

int main(void) {
	ll a, b;	cin >> a >> b;
	int n;	cin >> n;
	rep(i, 0, n) {
		ll t;	cin >> t;
		ll s = t >> 1;
		VV<ll> A = { {a,b},{1,0} };
		VV<ll> P = exp_mat(A, s);
		V<ll> v = { (P[0][0] + P[0][1]) % mod,(P[1][0] + P[1][1]) % mod };
		if (t & 1) {
			cout << ((v[0] + v[1] + a * v[0] % mod + b * v[1] % mod) % mod) << endl;
		}
		else {
			cout << ((v[0] + v[1]) % mod) << endl;
		}
	}

	return 0;
}