#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T;
ll A,B,N;

set<vector<int>> S;

void dfs(vector<int>& C) {
	if(S.count(C)) return;
	S.insert(C);
	int i;
	FOR(i,C.size()) {
		if(i+A<C.size()) {
			swap(C[i],C[i+A]);
			dfs(C);
			swap(C[i],C[i+A]);
		}
		if(i+B<C.size()) {
			swap(C[i],C[i+B]);
			dfs(C);
			swap(C[i],C[i+B]);
		}
	}
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	/*
	{
	vector<int> C={0,1,2,3,4,5};
	for(x=2;x<=C.size()-1;x++) {
		for(y=x;y<=C.size()-1;y++) if(__gcd(x,y)==1) {
			A=x;
			B=y;
			S.clear();
			dfs(C);
			cout<<x<<" "<<y<<" "<<S.size()<<endl;
		}
	}
	}
	return;
	*/
	cin>>T;
	while(T--) {
		cin>>A>>B>>N;
		
		if(__gcd(A,B)>1) {
			cout<<"NO"<<endl;
			continue;
		}
		if(min(A,B)<=N/2) {
			cout<<"YES"<<endl;
		}
		else {
			cout<<"NO"<<endl;
		}
		
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}