#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
vector<int> ve[N];
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  if (n == 1 && m == 1)
    puts("YES\n1");
  else if ((n <= 2 && m <= 3) || (n <= 3 && m <= 2))
    puts("NO");
  else if (n == 3 && m == 3)
    puts("YES\n6 1 8\n7 5 3\n2 9 4");
  else if ((n == 1 && m >= 4) || (n >= 4 && m == 1)) {
    puts("YES");
    int mx = max(n, m);
    for (int i = 2; i <= mx; i += 2) printf("%d ", i);
    for (int i = 1; i <= mx; i += 2) printf("%d ", i);
  } else {
    puts("YES");
    if (n < m) {
      int cnt = 1;
      for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++) ve[i].push_back(cnt++);
    } else {
      for (int i = 0; i < m; i++)
        for (int j = 0; j < n; j++) ve[i].push_back(i + 1 + j * m);
    }
    for (int i = 1; i < min(n, m); i += 2) {
      int tmp = ve[i][max(n, m) - 1];
      for (int j = max(n, m) - 1; j > 0; j--) ve[i][j] = ve[i][j - 1];
      ve[i][0] = tmp;
      tmp = ve[i][max(n, m) - 1];
      for (int j = max(n, m) - 1; j > 0; j--) ve[i][j] = ve[i][j - 1];
      ve[i][0] = tmp;
    }
    for (int j = 1; j < max(n, m); j += 2) {
      int tmp = ve[0][j];
      for (int i = 0; i < min(n, m) - 1; i++) ve[i][j] = ve[i + 1][j];
      ve[min(n, m) - 1][j] = tmp;
    }
    if (n < m) {
      for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
          printf("%d%c", ve[i][j], j == m - 1 ? '\n' : ' ');
    } else {
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
          printf("%d%c", ve[j][i], " \n"[j == m - 1]);
        }
      }
    }
  }
  return 0;
}
