#include <cstdio>
#include <algorithm>

using namespace std;

void Exgcd ( long long A, long long B, long long &k, long long &t )
{
    if ( !B )
    {
        k = 1;
        t = 0;
        return;
    }

    Exgcd(B, A % B, k, t);
    long long tmp = t;
    t = -k - A / B * t;
    k = -tmp;
    // printf("A = %lld B = %lld k = %lld t = %lld\n", A, B, k, t);
    return;
}

int T;
long long A, B, n;

void Work ()
{
    scanf("%lld%lld%lld", &A, &B, &n);

    if ( B == 1 )
    {
        if ( n <= A )
            printf("Yes\n");
        else
            printf("No\n");
    }
    else
    {
        long long k, t;
        Exgcd(A, B, k, t);

        printf("k = %lld t = %lld\n", k, t);
        t = ((t * (n % B)) % A + A) % A;
        printf("t = %lld\n", t);

        if ( n <= (n % B) + t * B )
            printf("Yes\n");
        else
            printf("No\n");
    }
    return;
}

int main ()
{
    scanf("%d", &T);
    while ( T -- )
        Work();

    return 0;
}