/*
	# Algorithm

	Naive

	## Time Complexity

	O(NT)
*/

#include <stdio.h>

constexpr int MOD = 1'000'000'007;

int main() {
	int A, B, N; scanf("%d%d%d", &A, &B, &N);

	using i64 = long long;
	while(N--) {
		int T; scanf("%d", &T);

		i64 r = 1, g = 1, b = 0;
		for(int t = 1; t <= T; t++) {
			if(t % 2) {
				(b += r * A + g * B) %= MOD;
			} else {
				g = r;
				r = b;
				b = 0;
			}
		}

		printf("%d\n", (r + g + b) % MOD);
	}
	return 0;
}