#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int H,W; cin >> H >> W;
    deque<vector<int>> E, O;
    int LL = 1, RR = H * W;
    rep(i,H) {
        vector<int> ans;
        deque<int> L, R;
        if(i % 2 == 0) {
            rep(_,(W+1)/2) L.push_back(LL++);
            rep(_,W/2) R.push_back(RR--);
            int LF = 1, RF = 1;
            while(!L.empty() || !R.empty()) {
                if(!L.empty()) {
                    if(LF) {
                        ans.push_back(L.front());
                        L.pop_front();
                    } else {
                        ans.push_back(L.back());
                        L.pop_back();
                    }
                    LF ^= 1;
                }
                if(!R.empty()) {
                    if(RF) {
                        ans.push_back(R.front());
                        R.pop_front();
                    } else {
                        ans.push_back(R.back());
                        R.pop_back();
                    }
                    RF ^= 1;
                }
            }
            E.push_back(ans);
        } else {
            rep(_,(W+1)/2) R.push_back(RR--);
            rep(_,W/2) L.push_back(LL++);
            int LF = 1, RF = 1;
            while(!L.empty() || !R.empty()) {
                if(!R.empty()) {
                    if(RF) {
                        ans.push_back(R.front());
                        R.pop_front();
                    } else {
                        ans.push_back(R.back());
                        R.pop_back();
                    }
                    RF ^= 1;
                }
                if(!L.empty()) {
                    if(LF) {
                        ans.push_back(L.front());
                        L.pop_front();
                    } else {
                        ans.push_back(L.back());
                        L.pop_back();
                    }
                    LF ^= 1;
                }
            }
            O.push_back(ans);
        }
    }

    vector<vector<int>> ans;
    int EF = 1, OF = 1;
    while(!E.empty() || !O.empty()) {
        if(!E.empty()) {
            if(EF) {
                ans.push_back(E.front());
                E.pop_front();
            } else {
                ans.push_back(E.back());
                E.pop_back();
            }
            EF ^= 1;
        }

        if(!O.empty()) {
            if(OF) {
                ans.push_back(O.front());
                O.pop_front();
            } else {
                ans.push_back(O.back());
                O.pop_back();
            }
            OF ^= 1;
        }
    }

    int S = ans[0][0] + ans[0][1] + ans[1][0] + ans[1][1];
    int ok = 1;
    rep(i,H-1)rep(j,W-1) ok &= ans[i][j] + ans[i+1][j] + ans[i][j+1] + ans[i+1][j+1] == S;
    assert(ok);

    cout << "Yes" << "\n";
    rep(i,H)rep(j,W) cout << ans[i][j] << " \n"[j == W - 1];
}