#include <bits/stdc++.h>

using namespace std;
using ll = long long;

ll modPow(ll x, ll n, ll mod) {
    if (!n)return 1;
    ll u = modPow(x, n / 2, mod);
    u = u * u % mod;
    if (n % 2) u = u * x % mod;
    return u;
}

ll euclid(ll a, ll b, ll &x, ll &y) {
    if (!b) return x = 1, y = 0, a;
    ll d = euclid(b, a % b, y, x);
    return y -= a / b * x, d;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    auto find = [&](ll a, ll b, ll cur) {
        set <ll> s;
        ll mx = 0;
        while (!s.count(cur)) {
            mx = max(mx, cur);
            cout << mx << endl;
            s.insert(cur);
            ll k = (-cur % a * modPow(b, a - 2, a)) % a;
            if (k < 0)k += a;
            cur += k * b;
            assert(cur % a == 0);
            cur /= a;
        }
        return s;
    };
    auto stupid = [&](ll a, ll b, ll n) {
        set <ll> s;
        ll st = n;
        while (!s.count(n)) {
            s.insert(n);
            if (n % a == 0)n /= a;
            else n += b;
        }
        return n == st;
    };
    auto rofl = [&](ll a, ll b, ll n) {
        if (a + b > n)return 1;
        if (a + b == n)return 0;
        if (n > a * b)return 0;
        for (ll x = 0; x <= n; ++x) {
            for (ll y = 0; y <= n; ++y) {
                if (a * b - x * a - y * b == n)return 1;
            }
        }
        return 0;
    };
    auto smart = [&](ll a, ll b, ll n) -> bool {
        if (a + b > n)return 1;
        if (a + b == n)return 0;
        if (n > a * b)return 0;
        ll need = a * b - n;
        ll x, y;
        euclid(a, b, x, y);
        x *= need;
        y *= need;
        if (x < 0 && y < 0)return 0;
        if (x >= 0 && y >= 0)return 1;
        if (x < 0) {
            y %= a;
            x = (need - y * b) / a;
        } else if (y < 0) {
            x %= b;
            y = (need - x * a) / b;
        }
        return x >= 0 && y >= 0;
    };
    ll t;
    cin >> t;
    while (t--) {
        ll a, b, n;
        cin >> a >> b >> n;
        cout << (smart(a, b, n) ? "Yes" : "No") << "\n";
    }
}