#include <bits/stdc++.h>
#define pb push_back
#define x first
#define y second

#define int long long

using namespace std;
using vi=vector<int>;

typedef long long ll;

const int N = 3e6 + 500;

int tmp[N], odg[N], cnt[N], svi[N], out = 0, in = 0;

vi mul(vi a,vi b)
{
	vi c;
	for (auto x: a) for (auto y: b) c.pb(x+y);
	return c;
}

vi getvec(int cn,int x)
{
	vi v;
	for (int i=0;i<cn;++i) v.pb(i*x);
	return v;
}

pair<vi,vi> decomp(int n,int a)
{
	assert(n%a==0);
	return {getvec(a,1),getvec(n/a,a)};
}

void solve(){
	int n, m; cin >> n >> m;
	if(n < m) swap(n, m);
	ll fak = (ll)n * m;
	ll poc = sqrt(fak) + 1;
	vi a1,a2;
	bool nad=0;
	if (n==m)
	{
		ll u=sqrt(n)+1;
		while (u*u>n) --u;
		if (u*u==n)
		{
			auto r1=decomp(n,u);
			a1=mul(r1.x,r1.x);
			a2=mul(r1.y,r1.y);
			nad=1;
		}
	}
	while (poc * poc > fak) poc--;
	for(ll i = poc;i >= 1;i--) {
		if (nad) break;
		if(fak % i == 0 && i != m && i + fak / i < (ll)n + 2 * m) {
			ll u=i,v=fak/i;
			ll u1=__gcd(u,n),u2=u/u1;
			ll v1=n/u1,v2=m/u2;
			assert(u1*v1==n);
			assert(u2*v2==m);
			assert(u1*u2==u);
			assert(v1*v2==v);
			auto r1=decomp(n,u1),r2=decomp(m,u2);
			a1=mul(r1.x,r2.x);
			a2=mul(r1.y,r2.y);
			nad=1;
			break;
		}
		if (fak%i==0 && i==m && i!=n && __gcd(n,m)>1)
		{
			ll u=__gcd(n,m);
			auto r1=decomp(n,u),r2=decomp(m,m/u);
			a1=mul(r1.x,r2.x);
			a2=mul(r1.y,r2.y);
			nad=1;
			break;
		}
		
	}
	if (!nad)
	{
		for (int i=0;i<n;++i) a1.pb(i);
		for (int i=0;i<m;++i) a2.pb(i),a2.pb(i);
		nad=1;
	}
	int f1=a1.size(),f2=a2.size();
	//cout << n << " " << m << "\n";
	
	cout<<f1<<"\n";
	for (auto x: a1) cout<<x+1<<' ';
	cout<<"\n";
	cout<<f2<<"\n";
	for (auto x: a2) cout<<x+1<<' ';
	cout<<"\n";
	
	out += f1 + f2; in += n;
	//cout << n << " " << m << " 		" << f1 << " " << f2 << endl;
	//if(f1 + f2 >= n + m) cout << "kurcina\n";
}

signed main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	int T; cin >> T;
	//cout << T << endl;
	for(;T--;) {
		//printf("T = %d\n", T);
		solve();
	}
	//cout << in << endl;
	//cout << out << endl;
}