#include"bits/stdc++.h"
using namespace std;
#define mod 1000000007
#define vi vector<int>
#define eps 0.0000001
#define pb push_back
#define mp make_pair
#define ll long long
#define sll signed long long 
#define ull unsigned long long 
#define u_map unordered_map<int,int>
#define vll vector<ll>
#define vi vector<int>
#define up upper_bound
#define lb lower_bound 
#define ins insert
#define pie  3.1415926535
#define f(in,n,it) for(int i=in;i<n;i+=it)
#define fr(in,end,it) for(int i=in;i>=end;i-=it)
#define line cout<<'\n';
#define space cout<<" ";
#define pi pair<int,int>
//#define sort(x) sort(x.begin(),x.end())
#define tt int t;cin>>t;while(t--)
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);

void ans_nikalo(){
ll r,b,d;
cin>>r>>b>>d;
 ll mx=(max(r,b));
 ll mn=min(r,b);
 ll q=mx/mn;
 int y=(mx-mn)%mn;
 int x=(mx-mn)/mn;
 if(y) x++; 
 if(x>d) cout<<"NO\n";
 else cout<<"YES\n";
}
int main() { 
    #ifndef ONLINE_JUDGE
   freopen("input.txt", "r", stdin);
   freopen("output.txt", "w", stdout);
    #endif   
         fio
         //find_prime(1000001);         
   tt ans_nikalo();
         
    return 0; 
}