#include <bits/stdc++.h>

using namespace std;

#define dbg(x) cout << #x << " = " << x << "\n";
#define jiasu ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

typedef long long LL;
typedef pair<LL, LL> PLL;

const LL N = 1e6 + 1;
const LL M = 2020;
const LL mod = 1e9 + 7;

LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a * b / gcd(a, b); }

LL qsm(LL a, LL b, LL m)
{
    LL w = 1;
    a %= m;
    while (b)
    {
        if (b & 1) w = (w * a) % m;
        a = a * a % m;
        b >>= 1;
    }
    return w;
}

LL A(LL n, LL m)
{
    LL w = 1;
    while (m--)
    {
        w = w * n;
        n -= 1;
    }
    return w;
}

LL C(LL n, LL m)
{
    LL w = 1;
    m = min(m, n - m);
    for (LL i = 1; i <= m; ++i)
    {
        w = w * (n - m + i) / i;
    }
    return w;
}

LL ol(LL n)
{
    LL w = n;

    for (int i = 2; i <= sqrt(n); ++i)
    {
        if (n % i == 0)
        {
            w = w / i * (i - 1);

            while (n % i == 0) n /= i;
        }
    }

    if (n >= 2) w = w / n * (n - 1);

    return w;
}

LL a[N];
unordered_map<LL, LL> e;
LL w = 0;

LL x[N], y[N];

void solve()
{
    LL n, m;
    cin >> n >> m;
    
    if (n >= m)
    {
    x[1] = 1;
    y[1] = 1;
    for (int i = 2; i <= n; ++i)
    {
        x[i] = a[n + m - i + 1];
    }
    
    for (int i = 2; i <= m; ++i)
    {
        y[i] = a[i];
    }
    }
    else
    {
    x[1] = 1;
    y[1] = 1;
    for (int i = 2; i <= m; ++i)
    {
        y[i] = a[n + m - i + 1];
    }
    
    for (int i = 2; i <= n; ++i)
    {
        x[i] = a[i];
    }        
    }
    
    
    if (e[x[n] * y[m] % (n * m)] != 0)
    {
        cout << "No\n";
    }
    else
    {
        cout << "Yes\n";
        for (int i = 1; i <= n; ++i)
        {
            cout << x[i] << " ";
        }
        cout << endl;
        for (int i = 1; i <= m; ++i)
        {
            cout << y[i] << " ";
        }
        cout << endl;
    }
    
    
    
}

// abbba

int main()
{
    jiasu;
    
    

    for (int i = 1; i <= 1e6; ++i)
    {
        LL o = 0;
        
        for (int j = 2; j * j <= i; ++j)
        {
            if (i % j == 0)
            {
                o = 1;
                break;
            }
        }
        
        if (!o) 
        {
            //cout << i << endl;
            a[++w] = i;
            e[i] = w;
        }
        
    }

    int t = 1;
    cin >> t;

    while (t--) solve();

    return 0;

}