#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int h, w; cin >> h >> w;
	bool swaped = false;
	if (1 == h % 2) swap(h, w), swaped = true;
	vector<vector<int>> a(h, vector<int>(w));
	int now = 1;
	for (int i = 0; i < h - 1; i += 2) {
		rep(j, w) {
			a[i][j] = now;
			a[i + 1][j] = h * w + 1 - now;
			if (1 == j % 2)swap(a[i][j], a[i + 1][j]);
			now++;
		}
	}
	if (1 == h % 2) {
		rep(j, w) {
			if (0 == j)a[h - 1][j] = now;
			else a[h-1][j] = 2 * (h*w + 1) - (a[h - 1][j - 1] + a[h - 2][j - 1] + a[h - 2][j]);
		}
	}//todo
	if (swaped) {
		swap(h, w);
		vector<vector<int>> sub(h, vector<int>(w));
		rep(i, h)rep(j, w)sub[i][j] = a[j][i];
		swap(a, sub);
	}
	cout << "Yes" << endl;
	rep(i, h) {
		rep(j, w) cout << a[i][j] << " ";
		cout << endl;
	}
	return 0;
}