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()) 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('Yes') for ret in A: print(*ret) if __name__ == '__main__': main()