#include using namespace std; using ll = long long; using pint = pair; void solve(); int main() { int T; cin >> T; while(T--)solve(); } bool f(ll x, ll y, ll N) { if(__gcd(x, y) != 1) return false; if(y * 2 <= N)return true; ll pos = N - y; // print(pos); if(pos + 1 >= x) { return true; } return false; } void solve() { ll N; cin >> N; ll x, y; cin >> x >> y; if(x > y)swap(x, y); if(f(x, y, N)) { cout << "YES" << endl; } else { cout << "NO" << endl; } }