#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.141592653589793238462643383;
struct Rcompare {
  bool operator()(pair<int, int> lhs, pair<int, int> rhs) {
    return lhs.first > rhs.first;
  }
};
struct compare {
  bool operator()(pair<int, int> lhs, pair<int, int> rhs) {
    return lhs.first < rhs.first;
  }
};
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  return a * (b / gcd(a, b));
}
long long int Abs(long long int a) {
  if (a > 0) return a;
  return -a;
}
long long int Ceil(long long int a, long long int b) {
  if (a % b == 0)
    return a / b;
  else
    return a / b + 1;
}
double Abs(double a) {
  if (a > 0) return a;
  return -a;
}
long long int pow(long long int x, long long int y) {
  if (y == 0) return 1;
  long long int tmp = pow(x, y / 2);
  if (y % 2 == 1) return ((tmp * tmp) * x);
  return (tmp * tmp);
}
const int MAX = 100009;
const int MOD = 1e9 + 7;
const int inf = 1e9 + 10;
vector<int> a[MAX];
deque<int> b[MAX];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < (n); ++i)
    for (int j = 0; j < (m); ++j) {
      int tmp;
      tmp = (i)*m + j + 1;
      a[i].push_back(tmp);
    }
  if (n == 1 && m == 1)
    cout << "YES\n1" << '\n';
  else if (n == 1 && m == 2)
    cout << "NO\n" << '\n';
  else if (n == 1 && m == 3)
    cout << "NO\n" << '\n';
  else if (n == 3 && m == 1)
    cout << "NO\n" << '\n';
  else if (n == 2 && m == 1)
    cout << "NO\n" << '\n';
  else if (n == 2 && m == 2)
    cout << "NO\n" << '\n';
  else if (n == 2 && m == 3)
    cout << "NO\n" << '\n';
  else if (n == 3 && m == 2)
    cout << "NO\n" << '\n';
  else if (n == 3 && m == 3) {
    cout << "YES\n";
    cout << a[0][0] << ' ' << a[2][2] << ' ' << a[1][1] << ' ' << '\n'
         << a[1][2] << ' ' << a[0][1] << ' ' << a[2][0] << ' ' << '\n'
         << a[2][1] << ' ' << a[1][0] << ' ' << a[0][2] << ' ' << '\n';
  } else if (m == 1) {
    b[0].push_back(a[1][0]), b[0].push_back(a[3][0]), b[0].push_back(a[0][0]),
        b[0].push_back(a[2][0]);
    cout << "YES\n";
    for (int j = 4; j <= (n - 1); ++j) {
      if (j % 2 == 1) b[0].push_back(a[j][0]);
      if (j % 2 == 0) b[0].push_front(a[j][0]);
    }
    for (int i = 0; i < (n); ++i) cout << b[0][i] << '\n';
  } else if (m == 2) {
    b[0].push_back(a[1][0]), b[0].push_back(a[3][0]), b[0].push_back(a[0][0]),
        b[0].push_back(a[2][0]);
    for (int j = 5; j <= (n - 1); ++j) b[0].push_back(a[j][0]), j++;
    for (int j = 4; j <= (n - 1); ++j) b[0].push_back(a[j][0]), j++;
    b[1].push_back(a[2][1]), b[1].push_back(a[0][1]), b[1].push_back(a[3][1]),
        b[1].push_back(a[1][1]);
    for (int j = 4; j <= (n - 1); ++j) b[1].push_back(a[j][1]), j++;
    for (int j = 5; j <= (n - 1); ++j) b[1].push_back(a[j][1]), j++;
    cout << "YES\n";
    for (int i = 0; i < (n); ++i) cout << b[0][i] << ' ' << b[1][i] << '\n';
  } else if (m == 3) {
    b[0].push_back(a[1][0]), b[0].push_back(a[3][0]), b[0].push_back(a[0][0]),
        b[0].push_back(a[2][0]);
    for (int j = 5; j <= (n - 1); ++j) b[0].push_back(a[j][0]), j++;
    for (int j = 4; j <= (n - 1); ++j) b[0].push_back(a[j][0]), j++;
    b[1].push_back(a[2][1]), b[1].push_back(a[0][1]), b[1].push_back(a[3][1]),
        b[1].push_back(a[1][1]);
    for (int j = 4; j <= (n - 1); ++j) b[1].push_back(a[j][1]), j++;
    for (int j = 5; j <= (n - 1); ++j) b[1].push_back(a[j][1]), j++;
    b[2].push_back(a[1][2]), b[2].push_back(a[3][2]), b[2].push_back(a[0][2]),
        b[2].push_back(a[2][2]);
    for (int j = 5; j <= (n - 1); ++j) b[2].push_back(a[j][2]), j++;
    for (int j = 4; j <= (n - 1); ++j) b[2].push_back(a[j][2]), j++;
    cout << "YES\n";
    for (int i = 0; i < (n); ++i)
      cout << b[0][i] << ' ' << b[1][i] << ' ' << b[2][i] << '\n';
  } else {
    for (int i = 0; i < (n); ++i) {
      if (i % 2 == 0)
        b[i].push_back(a[i][1]), b[i].push_back(a[i][3]),
            b[i].push_back(a[i][0]), b[i].push_back(a[i][2]);
      else
        b[i].push_back(a[i][2]), b[i].push_back(a[i][0]),
            b[i].push_back(a[i][3]), b[i].push_back(a[i][1]);
      if (i % 2 == 0) {
        for (int j = 5; j <= (m - 1); ++j) b[i].push_back(a[i][j]), j++;
        for (int j = 4; j <= (m - 1); ++j) b[i].push_back(a[i][j]), j++;
      }
      if (i % 2 == 1) {
        for (int j = 4; j <= (m - 1); ++j) b[i].push_back(a[i][j]), j++;
        for (int j = 5; j <= (m - 1); ++j) b[i].push_back(a[i][j]), j++;
      }
    }
    cout << "YES\n";
    for (int i = 0; i < (n); ++i) {
      for (int j = 0; j < (m); ++j) cout << b[i][j] << ' ';
      cout << '\n';
    }
  }
  return 0;
}
