#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }
inline void YesNo(bool f, string yes = "Yes", string no = "No") { std::cout << (f? yes: no) << std::endl; }


template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int h, w;
    cin >> h >> w;
    cout << "Yes" << endl;
    vector ans(h, vector<int>(w));
    bool f = (w % 2) == 0;
    int now = 0;
    for (int i = 1; i <= h * w; i++) {
        int j = h * w - i + 1;
        if (i > j) break;
        ans[now / w][now % w] = (f && (now / w) & 1? j: i);
        now++;
        if (i >= j) break;
        ans[now / w][now % w] = (f && (now / w) & 1? i: j);
        now++;
    }
    for (auto& v: ans) cout << v << endl;
    int s = 0;
    rep(i, 2) rep(j, 2) s += ans[i][j];
    rep(i, h - 1) rep(j, w - 1) {
        int tmp = 0;
        rep(k, 2) rep(l, 2) tmp += ans[i + k][j + l];
        assert(tmp == s);
    }
}