#include <bits/stdc++.h>
using namespace std;
using Int = long long;
constexpr static int mod = 1e9 + 7;
constexpr static int inf = (1 << 30) - 1;
constexpr static Int infll = (1LL << 61) - 1;
int Competitive_Programming = (ios_base::sync_with_stdio(false), cin.tie(nullptr), cout << fixed << setprecision(15), 0);
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

void solve()
{
	Int N, a, b;
	cin >> N >> a >> b;
	assert(1 <= N and N <= 1e18);
	assert(1 <= a and a < N);
	assert(1 <= b and b < N);
	if (gcd(a, b) == 1 and a + b <= N + 1)
	{
		cout << "YES\n";
	}
	else
	{
		cout << "NO\n";
	}
}

int main()
{
	int t;
	cin >> t;
	while (t--)
		solve();
}