#include <bits/stdc++.h>
using namespace std;
int a[100005][5], n, m, tot;
int p[100005], cnt[100005];
bool vis[100005];
inline int get(int a, int b) {
  if (a <= 0 || a > n || b <= 0 || b > m) return -1;
  return (a - 1) * m + b;
}
inline int cal(int pos) {
  if (pos < 0) return -2;
  return p[pos];
}
inline bool chk(int id, int tar) {
  for (int i = 1; i <= cnt[id]; i++) {
    if (a[id][i] == tar) return 1;
  }
  return 0;
}
void getans(int pos) {
  if (pos == tot + 1) {
    puts("YES");
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        printf("%d ", p[get(i, j)]);
      }
      puts("");
    }
    exit(0);
  }
  if (((double)(clock())) / CLOCKS_PER_SEC > 1.96) {
    puts("NO");
    exit(0);
  }
  int ts = tot * 2;
  while (ts--) {
    p[pos] = (rand() * 32768 + rand()) % tot + 1;
    if (vis[p[pos]]) continue;
    if (chk(p[pos], cal(pos - 1))) continue;
    if (chk(p[pos], cal(pos - m))) continue;
    vis[p[pos]] = 1;
    getans(pos + 1);
    vis[p[pos]] = 0;
  }
}
int main() {
  srand((unsigned long long)new char);
  int i, j;
  scanf("%d%d", &n, &m);
  tot = n * m;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      int id = get(i, j);
      a[id][++cnt[id]] = get(i - 1, j);
      a[id][++cnt[id]] = get(i, j - 1);
      a[id][++cnt[id]] = get(i, j + 1);
      a[id][++cnt[id]] = get(i + 1, j);
    }
  }
  for (i = 1; i <= tot; i++) p[i] = i;
  getans(1);
  puts("NO");
  return 0;
}
