D-Half Turns_2025牛客国庆集训派对day4

时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 512 M，其他语言1024 M
Special Judge, 64bit IO Format: %lld

题目描述

Given two even integers $n$ and $m$ , construct a matrix $M$ satisfying following constraints:

The number of rows and columns of $M$ are $n$ and $m$ respectively.
For each integer $i$ $(1 \le i \le nm)$ , $i$ appears exactly once in $M$ .
For each two adjacent integers $i$ and $i+1$ $(1 \le i < nm)$ , denoting $M_{x_1,y_1} = i$ and $M_{x_2,y_2} = i+1$ , then $|x_1 - x_2| + |y_1 - y_2| = 1$ holds.
The number of turning integers is exactly $\frac{nm}{2}$ , where $i$ $(1 < i < nm)$ is a turning integer iff the three integers $i-1$ , $i$ and $i+1$ are not in the same row or the same column.

If multiple solution exist, print any one of them. If no solution exist, report it.

输入描述:

The only line contains two even integers  and  .

输出描述:

If no solution, print "No" (without quotes) in one line.
If solution exists, print "Yes" (without quotes) in the first line. Then print  lines each containing  integers , denoting the answer matrix.

示例1

输入

复制

4 4

输出

复制

Yes
2 3 4 5
1 8 7 6
16 9 10 11
15 14 13 12

说明

In the sample case, the number of turning integers is , which equals , and the 8 turning integers are .