description: The only difference between this problem and D2 is that you don't have to provide the way to construct the answer in this problem, but you have to do it in D2.
  
  There's a table of n × m cells (n rows and m columns). The value of n ⋅ m is even.
  
  A domino is a figure that consists of two cells having a common side. It may be horizontal (one of the cells is to the right of the other) or vertical (one of the cells is above the other).
  
  You need to find out whether it is possible to place nm/2 dominoes on the table so that exactly k of them are horizontal and all the other dominoes are vertical. The dominoes cannot overlap and must fill the whole table.
  
  Input
  
  The first line contains one integer t (1 ≤ t ≤ 10) — the number of test cases. Then t test cases follow.
  
  Each test case consists of a single line. The line contains three integers n, m, k (1 ≤ n,m ≤ 100, 0 ≤ k ≤ nm/2, n ⋅ m is even) — the number of rows, columns and horizontal dominoes, respectively.
  
  Output
  
  For each test case output "YES", if it is possible to place dominoes in the desired way, or "NO" otherwise.
  
  You may print each letter in any case (YES, yes, Yes will all be recognized as positive answer, NO, no and nO will all be recognized as negative answer).
  
  Example
  
  Input
  
  
  8
  4 4 2
  2 3 0
  3 2 3
  1 2 0
  2 4 2
  5 2 2
  2 17 16
  2 1 1
  
  
  Output
  
  
  YES
  YES
  YES
  NO
  YES
  NO
  YES
  NO
solution: 
  
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.Arrays;
  import java.util.Random;
  import java.util.StringTokenizer;
  
  public final class D1 {
  
      public static void main(String[] args) {
          final FastScanner fs = new FastScanner();
          final int t = fs.nextInt();
          for (int test = 0; test < t; test++) {
              final int n = fs.nextInt();
              final int m = fs.nextInt();
              final int k = fs.nextInt();
              final int l = ((n * m) / 2) - k;
              if (n % 2 != 0) {
                  if (k - (m / 2) < 0 || (k - (m / 2)) % 2 != 0) {
                      System.out.println("NO");
                  } else {
                      System.out.println("YES");
                  }
              } else if (m % 2 != 0) {
                  if (l - (n / 2) < 0 || (l - (n / 2)) % 2 != 0) {
                      System.out.println("NO");
                  } else {
                      System.out.println("YES");
                  }
              } else {
                  if (k % 2 != 0) {
                      System.out.println("NO");
                  } else {
                      System.out.println("YES");
                  }
              }
          }
      }
  
      static final class Utils {
          private static class Shuffler {
              private static void shuffle(int[] x) {
                  final Random r = new Random();
  
                  for (int i = 0; i <= x.length - 2; i++) {
                      final int j = i + r.nextInt(x.length - i);
                      swap(x, i, j);
                  }
              }
  
              private static void shuffle(long[] x) {
                  final Random r = new Random();
  
                  for (int i = 0; i <= x.length - 2; i++) {
                      final int j = i + r.nextInt(x.length - i);
                      swap(x, i, j);
                  }
              }
  
              private static void swap(int[] x, int i, int j) {
                  final int t = x[i];
                  x[i] = x[j];
                  x[j] = t;
              }
  
              private static void swap(long[] x, int i, int j) {
                  final long t = x[i];
                  x[i] = x[j];
                  x[j] = t;
              }
          }
  
          public static void shuffleSort(int[] arr) {
              Shuffler.shuffle(arr);
              Arrays.sort(arr);
          }
  
          public static void shuffleSort(long[] arr) {
              Shuffler.shuffle(arr);
              Arrays.sort(arr);
          }
  
          private Utils() {}
      }
  
      static class FastScanner {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st = new StringTokenizer("");
  
          private String next() {
              while (!st.hasMoreTokens()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      //noinspection CallToPrintStackTrace
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
          int[] nextIntArray(int n) {
              final int[] a = new int[n];
              for (int i = 0; i < n; i++) { a[i] = nextInt(); }
              return a;
          }
  
          long[] nextLongArray(int n) {
              final long[] a = new long[n];
              for (int i = 0; i < n; i++) { a[i] = nextLong(); }
              return a;
          }
      }
  }
  