#include<iostream>
#include <stdlib.h>
#include<math.h>
#include<cmath>
#include<vector>
#include<queue>
#include<algorithm>
#include<list>
#include<stack>
#include<map>
#include<deque>
#include<string>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include <iomanip>
typedef long long ll;
typedef unsigned long long ull;
typedef double  dou;
typedef long double ld;
typedef  int I;
using namespace std;
#define  E endl
/*
_  _  _  _  _ _
|               \    |`\              /`|
|      /`\       \   |  \   ------   /  |
|     /   \      /   |   \  \    /  /   |
|     \_ _/     /    |    \  \  /  /    |
|              /     |     \  \/  /     |
|             /      |      \    /      |
|             \      |  |`\  \  /  /`|  |
|     /``\     \     |  |  \  \/  /  |  |
|    /    \     \    |  |   \____/   |  |
|    \    /      \   |  |            |  |
|     \__/       /   |  |            |  |
|_ _ _ _ _ _ _ _/    |_ |            | _|
*/
void yes()
{
	cout << "YES" << E;
}
void no()
{
	cout << "NO" << E;
}
ll t, mod = 1e9 + 7;
#define loop(a,n) for(ll i=a;i<n;i++)
#define loopj(a,n) for(int j=a;j<n;j++)
#define loopk(a,n) for(int k=a;k<n;k++)
#define loopl(a,n) for(int l=a;l<n;l++)
#define loopp(a,n) for(int p=a;p<n;p++)
#define loop_r(a,n) for(int i=n-1;i>=a;i--)
#define loop_Jr(a,n) for(int j=n-1;j>=a;j--)
#define loop_it(m,it) for(it=m.begin();it!=m.end();it++)
#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC  cin>>t ;while(t--)
#define TC  cin>>t ;while(t--)
ll n,m,k;
bool  solve(ll x,ll y,ll sm){
	if (x == n&&y == m){
		if (sm == k)return 1;
		return 0;
	}
	if (x + 1 <= n)
		return solve(x + 1, y, sm + y);
	if (y+1<=m)
		return	solve(x , y+1, sm + x);
}
int main()
{
	speed;
	TC
	{
		cin >> n >> m >> k;
		if( solve(1,1,0))yes();
		else no();
	}
	return 0;
}