#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cstring>
#include <iomanip>
#include <unordered_map>
#include <numeric>

#define sc_int(x) scanf("%d", &x)

#define x first
#define y second
#define pb push_back

using namespace std;

const int N = 5e6 + 10, M = 5010, MOD = 998244353;
const int inf = 1e9;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef pair<char, int> PCI;
typedef pair<string, string> PSS;

LL n, m;

void solve()
{
    cin >> n >> m
    ;
    if(n == 1)
    {
        cout << "Yes" << endl;
        cout << 1 << endl;
        for(int i = 0; i < m; i ++) cout << i << " ";
        cout << endl;
        return;
    }
    
    if(m == 1)
    {
        cout << "Yes" << endl;
        for(int i = 0; i < n; i ++) cout << i << " ";
        cout << endl;
        cout << 1 << endl;
        return;
    }

    if(n == 2 && m == 3)
    {
        cout << "Yes" << endl;
        cout << "1 2" << endl;
        cout << "1 3 5" << endl;
        return;
    }
    if(n == 3 && m == 2)
    {
        cout << "Yes" << endl;
        cout << "1 3 5" << endl;
        cout << "1 2" << endl;
        return;
    }
    cout << "No" << endl;

}

int main()
{
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    // ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int T = 1;
    cin >> T;
    while(T --)
    {
        solve();
    }
}