#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
void exgcd(long long a, long long b, long long &d, long long &first,
           long long &second) {
  b                          ? exgcd(b, a % b, d, second, first),
      second -= a / b *first : first = 1, second = 0, d = a;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
const int N = 4e5 + 10;
const int dx[] = {0, 0, -1, 1};
const int dy[] = {1, -1, 0, 0};
int n, m, a[N];
int check(int i, int j) {
  int x1 = (i - 1) / m + 1, y1 = (i - 1) % m + 1;
  int x2 = (j - 1) / m + 1, y2 = (j - 1) % m + 1;
  for (int i = 0; i <= 3; ++i)
    if (x1 + dx[i] == x2 && y1 + dy[i] == y2) return 0;
  return 1;
}
int dfs(int cur) {
  if (cur > n * m) return 1;
  int first = 0, second = 0;
  if ((cur - 1) % m) first = a[cur - 1];
  if (cur > m) second = a[cur - m];
  for (int i = cur; i <= n * m; ++i) {
    swap(a[cur], a[i]);
    if (first && !check(a[cur], first)) continue;
    if (second && !check(a[cur], second)) continue;
    if (dfs(cur + 1)) return 1;
    swap(a[cur], a[i]);
  }
  return 0;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n * m; ++i) a[i] = i;
  if (!dfs(1)) return puts("NO"), 0;
  puts("YES");
  for (int i = 1; i <= n * m; ++i) printf("%d%c", a[i], " \n"[i % m == 0]);
}
