#include <iostream>
#include <queue>
using namespace std;

int main()
{
	queue<int> Q;
	int x, y;
	int n;
	cin >> x >> y;
	cin >> n;
	for (int i = 0; i < n; i++) {
		int pby1;
		cin >> pby1;
		
		bool can_be_paved=
			(x % pby1 == 0 && (y-1) % pby1 == 0 && (x-1) % pby1 == 0 && (y-2) % pby1 == 0) ||
			(y % pby1 == 0 && (x-1) % pby1 == 0 && (y-1) % pby1 == 0 && (x-2) % pby1 == 0);
			
		if (can_be_paved) 
			Q.push(1);
		else
			Q.push(0);
		
	}
	while (!Q.empty())
	{
		if (Q.front())
			cout << "YES\n";
		else
			cout << "NO\n";
		Q.pop();
	}
	
	return 0;
}