#pragma GCC optimize("O2")
#include<bits/stdc++.h> 
#include<iostream>
using namespace std;
#define int long long int
#define ll long long int
#define ld long double
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define endl '\n'
// __builtin_popcount(x)
#define sp setprecision(15)<<fixed
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl
const int mod=1000000007;
const int INF64=mod*mod+1;

void solve(){
	int n,m,k;
	cin>>n>>m>>k;

	if(n>m)
		swap(n,m);

	int mn=(m)*n-1,mx=min((m-1)+(n-1)*m,(n-1)+n*(m-1));

	// cout<<mn<<" "<<mx<<endl;

	if(k>=mx&&k<=mn)
		yes;
	else
		no;
}

int32_t main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);

	int T=1;
	cin>>T;
	for(int i=1;i<=T;i++){
		// cout<<"Case #"<<i<<": ";
		solve();
	}
	cerr<<"Time : "<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n";
}