#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

void sol()
{
    int n, m;
    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 == 0 && m % 2 == 0)
    {
        cout << "No" << endl;
        return;
    }
    cout << "Yes" << endl;
    if (n % 2 && m % 2)
    {
        if(max(n,m) % min(n,m) == 0){
            cout << "No" << endl;
            return ;
        }
        if (n < m)
        {
            for (int i = 1; i <= n; i++)
            {
                cout << i << " ";
            }
            cout << endl;

            for (int i = 1; i <= m; i++)
            {
                cout << 1 + n * (i - 1) << " \n"[i == m];
            }
        }
        else
        {
            for (int i = 1; i <= n; i++)
            {
                cout << 1 + m * (i - 1) << " ";
            }
            cout << endl;

            for (int i = 1; i <= m; i++)
            {
                cout << i << " \n"[i == m];
            }
        }
    }
    else if (m % 2)
    {
        for (int i = 1; i <= n; i++)
        {
            cout << i << " ";
        }
        cout << endl;

        for (int i = 1; i <= m; i++)
        {
            cout << 1 + n * (i - 1) << " \n"[i == m];
        }
    }
    else if (n % 2)
    {
        for (int i = 1; i <= n; i++)
        {
            cout << 1 + m * (i - 1) << " ";
        }
        cout << endl;

        for (int i = 1; i <= m; i++)
        {
            cout << i << " \n"[i == m];
        }
    }
}

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        sol();
    }
    return 0;
}