#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> g1, g2;
vector<int> g[100005];
bool check(int x, int y, int k) {
  set<int> adj;
  adj.insert(k - 1), adj.insert(k + 1), adj.insert(k - m), adj.insert(k + m);
  bool flag = true;
  if (x != 0) {
    flag = !adj.count(g[x - 1][y]);
  }
  if (y != 0 && flag) {
    flag = !adj.count(g[x][y - 1]);
  }
  return flag;
}
void solve() {
  if (n == 1 && m == 1) {
    puts("YES\n1\n");
    return;
  }
  if (min(n, m) <= 2 && max(n, m) <= 3) {
    puts("NO");
    return;
  }
  if (n == 3 && m == 3) {
    puts("YES\n6 1 8\n7 5 3\n2 9 4\n");
    return;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      g[i].push_back(0);
      if ((i + j) % 2)
        g1.push_back(i * m + j + 1);
      else
        g2.push_back(i * m + j + 1);
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (i * m + j < g1.size())
        g[i][j] = g1[i * m + j];
      else {
        int cur = g2[i * m + j - g1.size()];
        if (!check(i, j, cur)) {
          random_shuffle(g2.begin() + (i * m + j - g1.size()), g2.end());
          j--;
          continue;
        } else {
          g[i][j] = cur;
        }
      }
    }
  }
  puts("YES");
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cout << g[i][j] << ' ';
    }
    puts("");
  }
}
int main() {
  cin >> n >> m;
  solve();
  return 0;
}
