#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define fi first
#define se second

typedef long long ll;
#define int ll

pair<int, int> para(int x, int y)
{
    if (x > y) swap(x, y);
    return {x, y};
}

void solve()
{
    int n, m;
    cin>>n>>m;

    array<int, 3> mn = {2*min(n, m) + max(n, m), -1, -1};
    for (int i=1; i*i<=n; i++)
        if (n%i == 0)
        for (int j=1; j*j<=m; j++)
            if (m%j == 0)
    {
        int x, y;
        x = i, y = j;
        if (para(x*y, n*m/x/y) != para(n, m)) mn = min(mn, {x*y + n*m/x/y, x, y});
        x = n/i, y = j;
        if (para(x*y, n*m/x/y) != para(n, m)) mn = min(mn, {x*y + n*m/x/y, x, y});
        x = i, y = m/j;
        if (para(x*y, n*m/x/y) != para(n, m))  mn = min(mn, {x*y + n*m/x/y, x, y});
        x = n/i, y = m/j;
        if (para(x*y, n*m/x/y) != para(n, m))  mn = min(mn, {x*y + n*m/x/y, x, y});
    }

    if (mn[1] < 0)
    {
        if (n > m)
            swap(n, m);
        cout<<2*n;
        for (int i=1; i<=n; i++)
            cout<<" "<<i<<" "<<i;
        cout<<"\n";
        cout<<m;
        for (int i=1; i<=m; i++)
            cout<<" "<<i;
        cout<<"\n";
        cout<<"\n";
        return;
    }

    vector<int> g1, g2;
    int x = mn[1];
    int y = mn[2];
    for (int i=1; i<=x; i++)
        for (int j=1; j<=y; j++)
            g1.pb(i+j-1);
    for (int i=1; i<=n; i+=x)
        for (int j=1; j<=m; j+=y)
            g2.pb(i+j-1);
//    cout<<x<<" "<<y<<"\n";
    cout<<g1.size();
    for (int i : g1) cout<<" "<<i;
    cout<<"\n";
    cout<<g2.size();
    for (int i : g2) cout<<" "<<i;
    cout<<"\n";
    cout<<"\n";
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin>>n;
    while (n--)
        solve();
}