#include <bits/stdc++.h>
#include <atcoder/modint>
using mint = atcoder::static_modint<(int)1e9 + 7>;
using namespace std;
template <class F> class y_combinator {
	F f;

  public:
	y_combinator(F&& f) : f(std::forward<F>(f)) {}
	template <class... Args> auto operator()(Args &&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back

const int M = 2;
using S = array<array<mint, M>, M>;
S op(S a, S b) {
	S res{};
	for(int i = 0; i < M; i++) {
		for(int k = 0; k < M; k++) {
			for(int j = 0; j < M; j++) {
				res[i][j] += a[i][k] * b[k][j];
			}
		}
	}
	return res;
}
S mpow(S a, ll n) {
	S res{};
	for(int i = 0; i < M; i++) res[i][i] = 1;
	while(n) {
		if(n & 1) {
			res = op(res, a);
		}
		a = op(a, a);
		n >>= 1;
	}
	return res;
}
void run_case() {
	int A, B, N;
	cin >> A >> B >> N;
	const S e{
		{
			{A,B},
			{1,0}
		}
	};
	
	while(N--) {
		ll T;
		cin >> T;
		bool f = T & 1;
		T /= 2;
		S res = mpow(e, T);
		ll a = 1, b = 1;
		mint p = res[0][0] * a + res[0][1] * b;
		mint q = res[1][0] * a + res[1][1] * b;
		mint ans = p + q;
		if(f) {
			ans += p*A+q*B;
		}
		cout << ans.val() << "\n";
	}
}

int main() {
	//std::ios_base::sync_with_stdio(false);
	//std::cin.tie(nullptr);
	std::fixed(std::cout).precision(16);
	int T = 1;
	//cin >> T;
	while(T--) run_case();
	return 0;
}