#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
// const int MOD = 1000000007;
const int MOD = 998244353;

bool check(int H, int W, vector<vector<int>> a) {
    vector<int> v;
    rep(i, H - 1) rep(j, W - 1) {
        int tmp = 0;
        rep(x, 2) rep(y, 2) tmp += a[i + x][j + y];
        v.eb(tmp);
    }
    rearrange(v);
    return (sz(v) == 1);
}

int main() {
    int H, W;
    cin >> H >> W;

    bool rev = false;

    if (H % 2 == 1 && W % 2 == 0) {
        swap(H, W);
        rev = true;
    }

    cout << "Yes\n";

    vector<vector<int>> a(H, vector<int>(W));
    rep(i, H / 2) {
        rep(j, W) {
            int c = j & 1;
            a[2 * i + c][j] = i * W + 1 + j;
            a[2 * i + (c ^ 1)][j] = (H - i) * W - j;
        }
    }

    if (H % 2 == 1) {
        rep(j, W) a[H - 1][j] = (H - 1) / 2 * W + 1 + j;
        if (W % 2 == 0) {
            rep(j, W / 2) {
                int x = W * (H + 1) / 2;
                a[H - 1][2 * j + 1] = x - 2 * j;
            }
        } else {
            rep(j, W / 2) {
                int x = W * (H + 1) / 2 - 1;
                a[H - 1][2 * j + 1] = x - 2 * j;
            }
        }
    }

    if (rev) {
        vector<vector<int>> b(W, vector<int>(H));
        rep(i, H) rep(j, W) b[j][i] = a[i][j];
        swap(H, W);
        swap(a, b);
    }

    // cout << check(H, W, a) << '\n';

    rep(i, H) print(a[i]);
}