from re import A
import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import math
import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
from collections import defaultdict
#from collections import deque
#import copy #DeepCopy: hoge = [_[:] for _ in hogehoge]
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

def main():
    H,W = map(int,input().split())

    Flag = False
    if H%2 == 1:
        if W%2 == 0:
            H,W = W,H
            Flag = True
    
    A = [[0]*W for _ in range(H)]

    s = H*W+1
    num = 0
    for i in range(H//2):
        for j in range(W):
            num += 1
            if j%2 == 0:
                A[i*2][j] = num
                A[i*2+1][j] = s-num
            else:
                A[i*2][j] = s-num
                A[i*2+1][j] = num

    if H%2 == 1:
        for j in range(W):
            num += 1
            A[H-1][j] = num
        # print(A)
        for j in range(W//4):
            nj = 2*j+1
            # print(nj,W-1-nj)
            A[H-1][nj],A[H-1][W-1-nj] = A[H-1][W-1-nj],A[H-1][nj]

    print('Yes')
    if not Flag:
        for ret in A:
            print(*ret)
    else:
        B = [[0]*H for _ in range(W)]
        for i in range(H):
            for j in range(W):
                B[j][i] = A[i][j]
        for ret in B:
            print(*ret)

if __name__ == '__main__':
    main()