frog 有一张被划分为 $n$ 行 $m$ 列的纸。 今天，她想画一个周长不超过 $k$ 的矩形。
当 $n = m = 2, k = 6$ 时，有 $8$ 种（共 $9$ 种中的）画法
求画法的总数。
输入包含多组测试数据。对于每组测试数据：
第一行包含 $3$ 个整数 $n, m, k$ ($1 \leq n, m \leq 5 \cdot 10^4, 0 \leq k \leq 10^9$)。
对于每组测试数据，输出 $1$ 个整数，表示画法的总数。
2 2 6 1 1 0 50000 50000 1000000000
8 0 1562562500625000000
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: