#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << "Yes\n";
  int h, w;
  cin >> h >> w;
  VVI d(h, VI(w));
  rep(i, h) rep(j, w) d[i][j] = i * w + j + 1;
  VI t;
  for(int i = 1; i < h; i += 2) {
    rep(z, 2) {
      for(int j = z; j < w; j += 2) t.emplace_back(d[i][j]);
      for(int j = z; j < w; j += 2) d[i][j] = t.back(), t.pop_back();
    }
  }
  for(int j = 1; j < w; j += 2) {
    rep(z, 2) {
      for(int i = z; i < h; i += 2) t.emplace_back(d[i][j]);
      for(int i = z; i < h; i += 2) d[i][j] = t.back(), t.pop_back();
    }
  }
  rep(i, h) rep(j, w) cout << d[i][j] << " \n"[j + 1 == w];
}