#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
#include <immintrin.h>
#include <emmintrin.h>
#pragma comment(linker, "/STACK:1024000000,1024000000") 
#pragma GCC optimize(2)
#include<bits/stdc++.h> 
#define ll long long
#define I128 __int128
#define ld long double
#define PB push_back
using namespace std;
const int MAXN=1e5+666,mod=998244353,N=505;//
const ll INF=0x7ffffffffffffff;
const double PI=acos(-1);
typedef pair<int,int> pii;
template<class T>inline void MAX(T &x,T y){if(y>x)x=y;}
template<class T>inline void MIN(T &x,T y){if(y<x)x=y;}
template<class T>inline void rd(T &x){x=0;char o,f=1;while(o=getchar(),o<48)if(o==45)f=-f;do x=(x<<3)+(x<<1)+(o^48);while(o=getchar(),o>47);x*=f;}
template<class T>inline T ksm(T x,T y){T ans=1;while(y>0){if(y&1)ans=ans*x%mod;x=x*x%mod;y>>=1;}return ans;}
template<class T>inline T GCD(T x,T y){if(x==1||y==1)return 1;if(y>x)swap(x,y);while(x%y!=0){x=x%y;swap(x,y);}return y;}
int main()
{
	ll m,n,i,j,k,t; rd(t);
	while(t--)
	{
		rd(n); rd(m); rd(k);
		if(k==0&&n!=m){ cout<<"NO\n"; continue; }
		if(min(n,m)*k<abs(n-m)){ cout<<"NO\n"; continue; }
		cout<<"YES\n";
	}
}