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

    print("Yes")

    X=[[0]*W for _ in range(H)]
    B=[]

    for i in range(H):
        for j in range(W):
            k=i*W+j+1
            if (i+j)%2==0:
                X[i][j]=k
            else:
                B.append(k)

    B.reverse()
    for i in range(H-1,-1,-1):
        for j in range(W-1,-1,-1):
            if X[i][j]==0:
                X[i][j]=B.pop()

    for i in range(H):
        print(*X[i])

#==================================================
solve()