#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
double eps = 1e-12;
#define fast_cin()                    \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL)

#define fo(i, start, end) for (ll i = start; i < end; i++)
#define fo_r(i, end, start) for (ll i = end; i >= start; i--)
void init_code()
{
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}
int main()
{
    fast_cin();
    //init_code();
    ll t;
    cin >> t;
    while (t--)
    {
        ll n, m, k;
        cin >> n >> m >> k;
        if (n == 1)
        {
            if ((m - 1) == k)
                cout << "YES\n";
            else
                cout << "NO\n";
        }
        else if (m == 1)
        {
            if ((n - 1) == k)
                cout << "YES\n";
            else
                cout << "NO\n";
        }
        else
        {
            ll flag = 0;
            fo(i, 1, n)
            {
                fo(j, 1, m)
                {
                    ll cst = i + (n - i - 1) * (j + 1) + j * (i + 1) + (m - 1 - j) * n;
                    //cout<<cst<<" ";
                    if (cst == k)
                        flag = 1;
                }
            }
            fo(j, 1, m)
            {
                fo(i, 1, n)
                {
                    ll cst = j + (m - 1 - j) * (i + 1) + i * (j + 1) + (n - i - 1) * m;
                    //cout << cst << " ";
                    if (cst == k)
                        flag = 1;
                }
            }
            if (flag)
                cout << "YES\n";
            else
                cout << "NO\n";
        }
    }
    return 0;
}