#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const long long mod = 1e9 + 7;
const double eps = 1e-7;
int n, m;
vector<int> g[maxn], ans[maxn];
int flag = 0;
void print() {
  if (!flag) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) cout << ans[i][j] << " ";
      cout << endl;
    }
  } else {
    for (int j = 0; j < m; j++) {
      for (int i = 0; i < n; i++) cout << ans[i][j] << " ";
      cout << endl;
    }
  }
}
int main() {
  cin >> n >> m;
  if (n > m) {
    swap(n, m);
    flag = 1;
  }
  if (n == 1 && m == 1) {
    cout << "YES\n";
    cout << 1 << endl;
    return 0;
  }
  if (n == 1 && m <= 3) {
    cout << "NO\n";
    return 0;
  }
  if (n == 1 && m == 4) {
    cout << "YES\n";
    ans[0].push_back(2);
    ans[0].push_back(4);
    ans[0].push_back(1);
    ans[0].push_back(3);
    print();
    return 0;
  }
  if (n == 1 && m > 4) {
    cout << "YES\n";
    for (int i = 1; i <= m; i += 2) ans[0].push_back(i);
    for (int i = 2; i <= m; i += 2) ans[0].push_back(i);
    print();
    return 0;
  }
  if (n == 2 && m <= 3) {
    cout << "NO\n";
    return 0;
  }
  if (n == 3 && m == 3) {
    cout << "YES\n";
    ans[0].push_back(6);
    ans[0].push_back(1);
    ans[0].push_back(8);
    ans[1].push_back(7);
    ans[1].push_back(5);
    ans[1].push_back(3);
    ans[2].push_back(2);
    ans[2].push_back(9);
    ans[2].push_back(4);
    print();
    return 0;
  }
  cout << "YES\n";
  if (flag == 1) swap(n, m), flag = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) g[i].push_back(i * m + j + 1);
  }
  if (n <= m) {
    for (int i = 0; i < n; i += 2) {
      ans[i].push_back(g[i][m - 2]);
      ans[i].push_back(g[i][m - 1]);
      for (int j = 0; j < m - 2; j++) {
        ans[i].push_back(g[i][j]);
      }
    }
    for (int i = 1; i < n; i += 2) ans[i] = g[i];
    for (int i = 0; i < n; i++) g[i] = ans[i];
    for (int j = 0; j < m; j += 2) {
      for (int i = 0; i < n; i++) {
        ans[i][j] = (g[(i - 1 + n) % n][j]);
      }
    }
    print();
  } else {
    for (int i = 0; i < n; i++) ans[i] = g[i];
    for (int j = 0; j < m; j += 2) {
      for (int i = 0; i < n; i++) {
        ans[i][j] = g[(i - 2 + n) % n][j];
      }
    }
    for (int i = 0; i < n; i++) g[i] = ans[i];
    for (int i = 0; i < n; i += 2) {
      for (int j = 0; j < m; j++) {
        ans[i][j] = g[i][(j + 1) % m];
      }
    }
    print();
  }
  return 0;
}
