#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int mod = 1000000007;
const long double eps = 1e-9;
const int inf = ((1ll << 31ll) - 1ll);
const int INF = (((1ll << 59ll) - 1ll) * 2ll) + 1ll;
const long double pi = acos(-1);
int qpow(int b, int e) {
  if (!e) return 1;
  if (e & 1) return qpow(b, e - 1) * b % mod;
  int pwur = qpow(b, e >> 1);
  return pwur * pwur % mod;
}
int modinv(int x) { return qpow(x, mod - 2); }
int n, m, b[maxn][2], c[maxn][2];
pair<int, int> match[maxn];
set<int> s1, s2;
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.setf(ios::fixed);
  cout.precision(0);
  srand(time(NULL));
  cin >> n >> m;
  if (n == 1 && m == 4) {
    cout << "YES\n";
    cout << 2 << ' ' << 4 << ' ' << 1 << ' ' << 3 << '\n';
    return 0;
  }
  if (n == 4 && m == 1) {
    cout << "YES\n";
    cout << 2 << '\n' << 4 << '\n' << 1 << '\n' << 3 << '\n';
    return 0;
  }
  if (n == 1 && m == 1) {
    cout << "YES\n";
    cout << 1 << '\n';
    return 0;
  }
  if (n == 3 && m == 3) {
    cout << "YES\n";
    cout << 6 << ' ' << 1 << ' ' << 8 << '\n';
    cout << 7 << ' ' << 5 << ' ' << 3 << '\n';
    cout << 2 << ' ' << 9 << ' ' << 4 << '\n';
    return 0;
  }
  if (n <= 2 && m <= 2) {
    cout << "NO\n";
    return 0;
  }
  if (n <= 3 && m <= 3) {
    cout << "NO\n";
    return 0;
  }
  if (n == 1) {
    cout << "YES\n";
    for (int i = 1; i <= m; i += 2) cout << i << ' ';
    for (int i = 2; i <= m; i += 2) {
      cout << i;
      if (i == n || i == m - 1)
        cout << '\n';
      else
        cout << ' ';
    }
    return 0;
  }
  if (m == 1) {
    cout << "YES\n";
    for (int i = 1; i <= n; i += 2) cout << i << '\n';
    for (int i = 2; i <= n; i += 2) {
      cout << i;
      if (i == n || i == n - 1)
        cout << '\n';
      else
        cout << '\n';
    }
    return 0;
  }
  int a[n + 1][m + 1];
  memset(a, 0, sizeof a);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if ((i + j) % 2 == 0)
        s1.insert((i - 1) * m + j);
      else
        s2.insert((i - 1) * m + j);
    }
  }
  s1.insert(mod);
  s2.insert(mod);
  if (n <= m) {
    for (int i = 1; i <= m; i++) {
      b[i][0] = i;
      if (*s1.lower_bound(i) == i) s1.erase(i);
      if (*s2.lower_bound(i) == i) s2.erase(i);
    }
    for (int i = 1; i <= m; i++) {
      b[i][1] = m + i;
      if (*s1.lower_bound(m + i) == m + i) s1.erase(m + i);
      if (*s2.lower_bound(m + i) == m + i) s2.erase(m + i);
    }
    for (int i = 1; i <= m; i++) {
      if (i == m - 1) {
        if (i % 2)
          match[i] = {b[i][0], b[1][1]};
        else
          match[i] = {b[i][1], b[1][1]};
        continue;
      }
      if (i == m) {
        if (i % 2)
          match[i] = {b[i][0], b[2][0]};
        else
          match[i] = {b[i][1], b[2][0]};
        continue;
      }
      if (i % 2)
        match[i] = {b[i][0], b[i + 2][1]};
      else
        match[i] = {b[i][1], b[i + 2][0]};
    }
    int mx = 0;
    for (int i = 1; i <= ((n * m + 1) / 2 % m); i++) {
      a[(n + 2) / 2][i] = match[i].first;
      a[(n + 2) / 2 + 1][i] = match[i].second;
      mx = i;
    }
    for (int i = mx + 1; i <= m; i++) {
      a[(n + 2) / 2 - 1][i] = match[i].first;
      a[(n + 2) / 2][i] = match[i].second;
    }
    for (int i = 1; i <= n / 2; i++) {
      for (int j = 1; j <= m; j++) {
        if (!a[i][j]) {
          a[i][j] = *s1.begin();
          s1.erase(s1.begin());
        }
      }
    }
    for (int i = n / 2 + 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        if (!a[i][j]) {
          a[i][j] = *s2.begin();
          s2.erase(s2.begin());
        }
      }
    }
  } else {
    for (int i = 1; i <= n; i++) {
      b[i][0] = (i - 1) * m + 1;
      if (*s1.lower_bound((i - 1) * m + 1) == (i - 1) * m + 1)
        s1.erase((i - 1) * m + 1);
      if (*s2.lower_bound((i - 1) * m + 1) == (i - 1) * m + 1)
        s2.erase((i - 1) * m + 1);
    }
    for (int i = 1; i <= n; i++) {
      b[i][1] = (i - 1) * m + 2;
      if (*s1.lower_bound((i - 1) * m + 2) == (i - 1) * m + 2)
        s1.erase((i - 1) * m + 2);
      if (*s2.lower_bound((i - 1) * m + 2) == (i - 1) * m + 2)
        s2.erase((i - 1) * m + 2);
    }
    for (int i = 1; i <= n; i++) {
      if (i == n - 1) {
        if (i % 2)
          match[i] = {b[i][0], b[1][1]};
        else
          match[i] = {b[i][1], b[1][1]};
        continue;
      }
      if (i == n) {
        if (i % 2)
          match[i] = {b[i][0], b[2][0]};
        else
          match[i] = {b[i][1], b[2][0]};
        continue;
      }
      if (i % 2)
        match[i] = {b[i][0], b[i + 2][1]};
      else
        match[i] = {b[i][1], b[i + 2][0]};
    }
    int mx = 0;
    for (int i = 1; i <= ((n * m + 1) / 2 % n); i++) {
      a[i][(m + 2) / 2] = match[i].first;
      a[i][(m + 2) / 2 + 1] = match[i].second;
      mx = i;
    }
    for (int i = mx + 1; i <= n; i++) {
      a[i][(m + 2) / 2 - 1] = match[i].first;
      a[i][(m + 2) / 2] = match[i].second;
    }
    for (int i = 1; i <= m / 2; i++) {
      for (int j = 1; j <= n; j++) {
        if (!a[j][i]) {
          a[j][i] = *s1.begin();
          s1.erase(s1.begin());
        }
      }
    }
    for (int i = m / 2 + 1; i <= m; i++) {
      for (int j = 1; j <= n; j++) {
        if (!a[j][i]) {
          a[j][i] = *s2.begin();
          s2.erase(s2.begin());
        }
      }
    }
  }
  cout << "YES\n";
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cout << a[i][j];
      if (j < m)
        cout << ' ';
      else
        cout << '\n';
    }
  }
  return 0;
}
