/* Problem URL: https://codeforces.com/problemset/problem/1811/D */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;

constexpr int MAXN = 46;
ll fib[MAXN];

void pre()
{
    fib[0] = 1;
    fib[1] = 1;
    nrep(i, 2, MAXN) {
        fib[i] = fib[i - 1] + fib[i - 2];
    }
}

#define TEST 1

void solve()
{
    int n;
    ll x, y;
    cin >> n >> x >> y;

    ll h = fib[n];
    ll w = fib[n + 1];

    ll hl = 1;
    ll hr = h;
    ll wl = 1;
    ll wr = w;

    int now = 1;
    int cur = n;
    while (cur--) {
        now ^= 1;
        ll cost = fib[cur + 1];
        if (now) {
            ll thr = hr - cost;

            if (hl <= x && thr >= x) {
                hr = thr;
                continue;
            }

            ll thl = hl + cost;
            if (thl <= x && hr >= x) {
                hl = thl;
                continue;
            }

            cout << "NO\n";
            return;
        }

        ll twr = wr - cost;
        
        if (wl <= y && twr >= y) {
            wr = twr;
            continue;
        }

        ll twl = wl + cost;
        
        if (twl <= y && wr >= y) {
            wl = twl;
            continue;
        }

        cout << "NO\n";
        return;
    }
    
    cout << "YES\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}