#include <bits/stdc++.h>
using namespace std;
int n, m, nm, a[110000], ans[110000];
int ex;
bool near(int a, int b) {
  int ax = a / m, ay = a % m;
  int bx = b / m, by = b % m;
  if (ax == bx && abs(ay - by) == 1) return 1;
  if (ay == by && abs(ax - bx) == 1) return 1;
  return 0;
}
int main() {
  srand(time(NULL));
  scanf("%d%d", &n, &m);
  int nm = n * m;
  for (int i = 0; i < nm; i++) a[i] = i;
  while (clock() <= 1.9 * CLOCKS_PER_SEC) {
    random_shuffle(a, a + nm);
    set<pair<int, int>> now;
    for (int i = 0; i < nm; i++) now.insert(make_pair(a[i], i));
    for (int i = 0; i < nm; i++) {
      auto it = now.begin();
      while (1) {
        ex = 1;
        int now2 = it->second;
        if (i / m > 0 && near(now2, ans[i - m])) ex = 0;
        if (i % m > 0 && near(now2, ans[i - 1])) ex = 0;
        if (ex) {
          ans[i] = now2;
          now.erase(it);
          break;
        }
        it++;
        if (it == now.end()) {
          ex = 0;
          break;
        }
      }
      if (!ex) break;
    }
    if (ex) {
      puts("YES");
      for (int i = 0; i < nm; i++) {
        printf("%d ", ans[i] + 1);
        if (!((i + 1) % m)) puts("");
      }
      return 0;
    }
  }
  puts("NO");
  return 0;
}
