#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
  if (!b) return a;
  return gcd(b, a % b);
}
template <class T>
T power(T a, T b) {
  T res(1);
  while (b) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
template <class T>
T powerM(T a, T b, T mod) {
  T res(1);
  while (b) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return res;
}
const int infi = 2147483647;
const long long infl = 9223372036854775807;
int n, m, k, T, ok;
int p[100100];
int q[100100];
int a(int x, int y) { return p[(x - 1) * (m) + y]; }
int d;
bool check1(int val1, int val) {
  int q = val % m;
  if (q == 1) {
    if (val1 == val + 1) return 0;
  } else if (q == 0) {
    if (val1 == val - 1) return 0;
  } else {
    if (abs(val1 - val) == 1) return 0;
  }
  if (abs(val1 - val) == m) return 0;
  return 1;
}
bool check() {
  for (int i = 1; i <= (k); ++i) {
    int x = (i - 1) / m + 1;
    int y = (i % m) == 0 ? m : i % m;
    if (x > 1) {
      d = a(x - 1, y);
      if (!check1(d, p[i])) return 0;
    }
    if (x < n) {
      d = a(x + 1, y);
      if (!check1(d, p[i])) return 0;
    }
    if (y > 1) {
      d = a(x, y - 1);
      if (!check1(d, p[i])) return 0;
    }
    if (y < m) {
      d = a(x, y + 1);
      if (!check1(d, p[i])) return 0;
    }
  }
  return 1;
}
int vis[100100];
int dfs(int t) {
  if (t > k) {
    if (check()) {
      ok = 1;
      return 1;
    }
  }
  for (int i = 1; i <= (k); ++i)
    if (!vis[i]) {
      p[t] = i;
      vis[i] = 1;
      if (dfs(t + 1)) return 1;
      vis[i] = 0;
    }
  return 0;
}
void print() {
  for (int i = 1; i <= (n); ++i) {
    for (int j = 1; j <= (m); ++j) printf("%d", a(i, j)), putchar(' ');
    puts("");
  }
}
const int hh[] = {0, 2, 4, 1, 3};
const int hh1[] = {0, 3, 1, 4, 2};
int main() {
  scanf("%d", &n), scanf("%d", &m);
  int flag = 0;
  int upp = max(n, m), low = min(n, m);
  if (upp <= 3) {
    ok = 0;
    k = n * m;
    dfs(1);
    if (ok) {
      puts("YES");
      print();
    } else {
      puts("NO");
    }
  } else {
    puts("YES");
    if (upp < 5) {
      if (n >= m) {
        for (int i = 1; i <= (n); ++i) {
          for (int j = 1; j <= (m); ++j) {
            if (j & 1)
              printf("%d", j + (hh[i] - 1) * m);
            else
              printf("%d", j + (hh1[i] - 1) * m);
            putchar(' ');
          }
          putchar('\n');
        }
      } else {
        for (int i = 1; i <= (n); ++i) {
          if (i & 1) {
            for (int j = 1; j <= (m); ++j)
              printf("%d", (i - 1) * m + hh[j]), putchar(' ');
            putchar('\n');
          } else {
            for (int j = 1; j <= (m); ++j)
              printf("%d", (i - 1) * m + hh1[j]), putchar(' ');
            putchar('\n');
          }
        }
      }
    } else {
      int t = 0;
      if (n >= m) {
        for (int i = 1; i <= (n); ++i)
          if (i & 1) p[++t] = i;
        for (int i = 1; i <= (n); ++i)
          if (!(i & 1)) p[++t] = i;
        for (int i = 1; i <= (n); ++i) q[i] = p[i + 1];
        q[n] = p[1];
        for (int i = 1; i <= (n); ++i) {
          for (int j = 1; j <= (m); ++j) {
            if (j & 1)
              printf("%d", j + (p[i] - 1) * m);
            else
              printf("%d", j + (q[i] - 1) * m);
            putchar(' ');
          }
          putchar('\n');
        }
      } else {
        for (int i = 1; i <= (m); ++i)
          if (i & 1) p[++t] = i;
        for (int i = 1; i <= (m); ++i)
          if (!(i & 1)) p[++t] = i;
        for (int i = 1; i <= (m); ++i) q[i] = p[i + 1];
        q[m] = p[1];
        for (int i = 1; i <= (n); ++i) {
          if (i & 1) {
            for (int j = 1; j <= (m); ++j)
              printf("%d", (i - 1) * m + p[j]), putchar(' ');
            putchar('\n');
          } else {
            for (int j = 1; j <= (m); ++j)
              printf("%d", (i - 1) * m + q[j]), putchar(' ');
            putchar('\n');
          }
        }
      }
    }
  }
  return 0;
}
