#include <cstdio>
#include <algorithm>

using namespace std;

const int max1 = 1e6;

int T, n, m, a[max1 + 5], b[max1 + 5];
bool flag[max1 + 5];

void Work ()
{
    scanf("%d%d", &n, &m);
    for ( int i = 1; i <= n; i ++ )
        a[i] = i;
    for ( int i = 1; i <= m; i ++ )
        b[i] = (i - 1) * n + 1;
    
    for ( int i = 0; i < n * m; i ++ )
        flag[i] = false;
    
    for ( int i = 1; i <= n; i ++ )
        for ( int j = 1; j <= m; j ++ )
            flag[a[i] * b[j] % (n * m)] = true;
    
    for ( int i = 0; i < n * m; i ++ )
    {
        if ( !flag[i] )
        {
            printf("No\n");
            return;
        }
    }

    printf("Yes\n");

    for ( int i = 1; i <= n; i ++ )
        printf("%d ", a[i]);
    printf("\n");
    for ( int i = 1; i <= m; i ++ )
        printf("%d ", b[i]);
    printf("\n");
    return;
}

int main ()
{
    scanf("%d", &T);
    while ( T -- )
        Work();

    return 0;
}