#include <bits/stdc++.h>
using namespace std;
int f[100010];
int main() {
  int tot = 26, n, m, ans = 0;
  cin >> n >> m;
  if (m >= 4) {
    cout << "YES" << endl;
    int j = 0;
    for (int i = 1; i <= n; i++) {
      if (i & 1) {
        for (int i = 1; i <= m / 2; i++) cout << j + i * 2 << ' ';
        for (int i = 1; i <= m - m / 2; i++) cout << j + i * 2 - 1 << ' ';
        cout << endl;
        j += m;
      } else if (m & 1) {
        for (int i = 1; i <= m - m / 2; i++) cout << j + i * 2 - 1 << ' ';
        for (int i = 1; i <= m / 2; i++) cout << j + i * 2 << ' ';
        cout << endl;
        j += m;
      } else {
        for (int i = 1; i <= m - m / 2; i++)
          cout << j + (m - m / 2 - i + 1) * 2 - 1 << ' ';
        for (int i = 1; i <= m / 2; i++) cout << j + (m / 2 - i + 1) * 2 << ' ';
        cout << endl;
        j += m;
      }
    }
  } else if (n >= 4) {
    cout << "YES" << endl;
    int j = 0, q = 0;
    for (int i = 1; i <= m; i++) {
      if (i & 1) {
        for (int i = 1; i <= n / 2; i++) f[++q] = j + i * 2;
        for (int i = 1; i <= n - n / 2; i++) f[++q] = j + i * 2 - 1;
        j += n;
      } else if (n & 1) {
        for (int i = 1; i <= n - n / 2; i++) f[++q] = j + i * 2 - 1;
        for (int i = 1; i <= n / 2; i++) f[++q] = j + i * 2;
        j += n;
      } else {
        for (int i = 1; i <= n - n / 2; i++)
          f[++q] = j + (n - n / 2 - i + 1) * 2 - 1;
        for (int i = 1; i <= n / 2; i++) f[++q] = j + (n / 2 - i + 1) * 2;
        j += n;
      }
    }
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        int p = f[(j - 1) * n + i];
        cout << (p - 1) % n * m + (p - 1) / n + 1 << ' ';
      }
      cout << endl;
    }
  } else if (n == 3 && m == 3) {
    cout << "YES" << endl;
    cout << 1 << ' ' << 3 << ' ' << 5 << endl;
    cout << 6 << ' ' << 4 << ' ' << 9 << endl;
    cout << 8 << ' ' << 2 << ' ' << 7 << endl;
  } else if (n == 1 && m == 1) {
    cout << "YES" << endl;
    cout << 1 << endl;
  } else
    cout << "NO" << endl;
}
