#include <bits/stdc++.h>
using namespace std;
void print(const vector<vector<int> > &a) {
  for (int i = 0; i < a.size(); ++i) {
    for (int j = 0; j < a[0].size(); ++j) {
      if (j) putchar(' ');
      printf("%d", a[i][j]);
    }
    puts("");
  }
}
vector<vector<int> > transpose(const vector<vector<int> > &a) {
  vector<vector<int> > b(a[0].size(), vector<int>(a.size()));
  for (int i = 0; i < a[0].size(); ++i)
    for (int j = 0; j < a.size(); ++j) b[i][j] = a[j][i];
  return b;
}
int main(void) {
  int n, m;
  while (~scanf("%d%d", &n, &m)) {
    vector<vector<int> > a(n, vector<int>(m));
    for (int i = 0; i < n; ++i)
      for (int j = 0; j < m; ++j) a[i][j] = i * m + j + 1;
    vector<vector<int> > b = a;
    if (n == 1 && m == 1) {
      printf("YES\n1\n");
      continue;
    } else if (min(n, m) == 1) {
      if (max(n, m) <= 3) {
        printf("NO\n");
        continue;
      }
      if (n > 3) {
        if (n & 1)
          for (int i = 0; i < n; ++i) b[i][0] = a[(2 * i + 1) % n][0];
        else {
          for (int i = 0; i < n / 2; ++i) b[i][0] = a[2 * i + 1][0];
          for (int i = n / 2; i < n; ++i) b[i][0] = a[2 * i - n][0];
        }
      } else {
        if (m & 1)
          for (int i = 0; i < m; ++i) b[0][i] = a[0][(2 * i + 1) % m];
        else {
          for (int i = 0; i < m / 2; ++i) b[0][i] = a[0][2 * i + 1];
          for (int i = m / 2; i < m; ++i) b[0][i] = a[0][2 * i - m];
        }
      }
    } else if (min(n, m) == 2) {
      if (max(n, m) <= 3) {
        printf("NO\n");
        continue;
      }
      if (m == 2) a = transpose(a), b = a;
      int M = max(n, m);
      for (int i = 0; i < M; ++i) {
        int id = 2 * i;
        b[0][i] = a[id / M][id % M];
        ++id;
        b[1][i] = a[id / M][id % M];
      }
      a = b;
      for (int i = 0; i < M; ++i) b[1][i] = a[1][(i + M - 2) % M];
      if (m == 2) b = transpose(b);
    } else if (min(n, m) == 3) {
      if (max(n, m) == 3) {
        b[0][0] = 6, b[0][1] = 1, b[0][2] = 8;
        b[1][0] = 7, b[1][1] = 5, b[1][2] = 3;
        b[2][0] = 2, b[2][1] = 9, b[2][2] = 4;
      } else {
        if (m == 3) a = transpose(a), b = a;
        int M = max(n, m);
        for (int i = 0; i < M; ++i) b[1][i] = a[1][(i + M - 2) % M];
        for (int i = 0; i < M; ++i) swap(b[1][i], b[(i & 1) << 1][i]);
        if (m == 3) b = transpose(b);
      }
    } else {
      for (int j = 0; j < m; ++j) {
        if (n & 1)
          for (int i = 0; i < n; ++i) b[i][j] = a[(2 * i + 1) % n][j];
        else {
          for (int i = 0; i < n / 2; ++i) b[i][j] = a[2 * i + 1][j];
          for (int i = n / 2; i < n; ++i) b[i][j] = a[2 * i - n][j];
        }
      }
      a = b;
      for (int j = 0; j < n; ++j) {
        if (m & 1)
          for (int i = 0; i < m; ++i) b[j][i] = a[j][(2 * i + 1) % m];
        else {
          for (int i = 0; i < m / 2; ++i) b[j][i] = a[j][2 * i + 1];
          for (int i = m / 2; i < m; ++i) b[j][i] = a[j][2 * i - m];
        }
      }
    }
    printf("YES\n");
    print(b);
  }
  return 0;
}
