#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
    
    int tc;
    cin>>tc;
    while(tc--)
    {
      int n,m,k;
      cin>>n>>m>>k;
      vector<int> f;

      int dp[n][m];
      dp[n-1][m-1]=0;

      int d1=1;
      int d2=1;
      bool isValid=false;
      for(int i=n-1;i>=0;i--)
      {
        for(int j=m-1;j>=0;j--)
        {
          if(i==n-1 && j==m-1)
            dp[i][j]=0;

          else if(i==n-1 && j != m-1)
            {
              dp[i][j]=n*d1;

              d1++;  
            } 

           else if(j==m-1 && i!=n-1)
          {
            dp[i][j]=m*d2;

            d2++;
           }

          else
          {
            int left=dp[i][j+1];

            int downward=dp[i+1][j];

            int self=0;

            if(left<=downward)
               self=i+1;
            else
              self=j+1;
            
            dp[i][j]=min(left,downward)+self;

          } 

        }
      }
     
      int ans=dp[0][0];
      if(k==ans)
        cout<<"YES\n";
      else
        cout<<"NO\n";

        
    }
  return 0;
}