from collections import deque
import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

h, w = mi()

ans = [[0] * w for _ in range(h)]

s = deque(range(1, h * w + 1))

for i in range(h):
    for j in range(w):
        if (i + j) % 2:
            ans[i][j] = s.popleft()
        else:
            ans[i][j] = s.pop()
s = set()
for i in range(h - 1):
    for j in range(w - 1):
        s.add(ans[i][j] + ans[i + 1][j] + ans[i][j + 1] + ans[i + 1][j + 1])
        if len(s) >= 2:
            print('No')
            exit()
print('Yes')

for v in ans:
    print(*v)