for t in range(int(input())):
a, b = map(int, input().split())
if b == 1:
print('YES')
for k in range(1, a + 1):
print(k)
elif a == 1:
print('NO')
else:
if (a * b) % 2 == 0 and a % 2 == 0:
print('YES')
for i in range(a // 2):
print(*list(range(1 + i * b * 2, (i + 1 ) * b * 2 + 1, 2)))
print(*list(range(2 + i * b * 2, (i + 1 ) * b * 2 + 2, 2)))
else:
print('NO')#include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main(){
// your code goes here
int t;
cin>>t;
while(t--){
int n,k;
cin>>n>>k;
if(k==1){
cout<<"YES"<<"\n";
for(int i=1;i<=n;i++){
cout<<i<<"\n";
}
}
else{
if(n%2!=0){
cout<<"NO"<<"\n";
}
else{
cout<<"YES"<<"\n";
int v[n+1][k+1];
int cnt=1;
for(int i=1;i<=n/2;i++){
for(int j=1;j<=k;j++){
v[i][j] = cnt;
cnt+=2;
}
}
cnt=2;
for(int i=n/2 +1;i<=n;i++){
for(int j=1;j<=k;j++){
v[i][j] = cnt;
cnt+=2;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=k;j++){
cout<<v[i][j]<<" ";
}
cout<<"\n";
}
}
}
}
return 0;
}
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |