#include <atcoder/modint>

using mint = atcoder::modint998244353;

#include <iostream>
#include<vector>
#include<utility>
#include<algorithm>

int main() {

  int H, W;
  std::cin >> H >> W;

  std::vector a(H, std::vector<int>(W));

  for (int i = 0; i < H * W; i++) {
    a[i / W][i % W] = i + 1;
  }

  for (int r = 1; r < H; r += 2) {
    std::reverse(a[r].begin(), a[r].end());
  }

  for (int c = 1; c < W; c += 2) {
    for (int r = 0; r < H - r - 1; r++) {
      std::swap(a[r][c], a[H - r - 1][c]);
    }
  }

  std::cout << "Yes\n";
  for (auto& r : a) {
    for (int i = 0; i < W; i++) {
      std::cout << r[i] << " \n"[i + 1 == W];
    }
  }

  return 0;
}