CF1551D1.Domino (easy version)

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 \times m$ cells ($n$ rows and $m$ columns). The value of $n \cdot 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 $\frac{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.

本题与 D2 的唯一区别在于：本题不需要给出构造方案，而 D2 需要。

有一个 $n \times m$ 的表格（共 $n$ 行、$m$ 列）。已知 $n \cdot m$ 是偶数。

一个骨牌（domino）是由两个具有公共边的格子组成的图形。它可以是水平放置的（其中一个格子位于另一个格子右侧），也可以是竖直放置的（其中一个格子位于另一个格子上方）。

你需要判断：是否能在该表格上恰好放置 $\frac{nm}{2}$ 个骨牌，使得其中恰好 $k$ 个为水平骨牌，其余全部为竖直骨牌？骨牌之间不能重叠，且必须完全覆盖整个表格。

The first line contains one integer $t$ ($1 \le t \le 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 \le n,m \le 100$, $0 \le k \le \frac{nm}{2}$, $n \cdot m$ is even) — the number of rows, columns and horizontal dominoes, respectively.

第一行包含一个整数 $t$（$1 \le t \le 10$），表示测试用例的数量。随后是 $t$ 个测试用例。

每个测试用例由一行组成，该行包含三个整数 $n$、$m$、$k$（$1 \le n,m \le 100$，$0 \le k \le \frac{nm}{2}$，且 $n \cdot m$ 为偶数），分别表示网格的行数、列数以及水平放置的多米诺骨牌数量。

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).

对于每个测试用例，如果能够以期望的方式放置多米诺骨牌，则输出 “YES”，否则输出 “NO”。

你可以以任意大小写形式输出每个字母（例如，“YES”、“yes”、“Yes” 均被视为肯定回答；“NO”、“no”、“nO” 均被视为否定回答）。