#include <bits/stdc++.h>

int N, M;
int A[1010][1010];

int main() {
    scanf("%d%d", &N, &M);
    int low = 1, high = N * M;
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < M; ++j) {
            if (i + j & 1) A[i][j] = low++;
            else A[i][j] = high--;
        }
    }
    for (int i = 0; i < N - 1; ++i)
        for (int j = 0; j < M - 1; ++j)
            if (A[i][j] + A[i + 1][j] + A[i][j + 1] + A[i + 1][j + 1] != A[0][0] + A[0][1] + A[1][0] + A[1][1]) {
                puts("Boom");
            }
    puts("Yes");
    for (int i = 0; i < N; ++i) for (int j = 0; j < M; ++j) printf("%d%c", A[i][j], " \n"[j + 1 == M]);
}