#include<bits/stdc++.h>

typedef   long long  int ll;
typedef  long double ld;
typedef std::vector<ll> vi;
typedef std::vector<std::vector<ll> > vv;
typedef std::vector<std::pair<ll,ll> > pii;

#define mod 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,b) for(i=a;i<b;i++)
#define forr(i,a,b) for(i=a;i>=b;i--)
#define mp make_pair
#define pb(x) push_back(x)
#define fi first
#define se second
#define print(vec,a,b) for(ll i=a;i<b;i++) cout<<vec[i]<<" ";cout<<endl;
#define all(a) a.begin(),a.end()
#define input(vec,a,b) for(ll i = a;i<b;i++) cin>>vec[i];
#define ms(a,val) memset(a,val,sizeof(a))
using namespace std;

const int N = 2e5+ 5;



ll expo_pow(ll x, ll y) {
	if (y == 0)
		return 1;
	y = y % (mod - 1);
	x %= mod;
	if (y == 0)
		y = mod - 1;
	ll res = 1;
	while (y) {
		if (y & 1)
			res = (res * x) % mod;
		x = (x * x) % mod;
		y >>= 1;
	}
	return res;
}
 
ll modInverse(ll a, ll m = mod) {
	return expo_pow(a, m - 2);
}
	


void solve(){
            ll i,j,n,m;
            
            ll a,b,d;
            cin>>a>>b>>d;
            
            if(a > b)
            {
				if((1 + d)*b >= a)
				 cout<<"YES"<<endl;
				else
				 cout<<"NO"<<endl;
			 }
			 else if(b > a) 
             {
				if((1 + d)*a >= b)
				 cout<<"YES"<<endl;
				else
				 cout<<"NO"<<endl;
			 }
			 else
			  cout<<"YES"<<endl;
           
			
			
            
            
            
            
            
            
            
            
            
            
            
            
           
}



int main()
{
     IO;
      ll t=1,i;
      cin>>t;

		
      while(t--)
      {

          solve();
      }
    return 0;
}
