#include<iostream>
#include<cstdio>
#define N 1000000
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int gcd(int x,int y)
{
	if (!y) return x;
	return gcd(y,x%y);
}
int T,n,m,v[N+1],tong[N+1],tong2[N+1],length,length2;
bool nprime[N+1];
long long res,ans;
int main()
{
	int rt,x,y,d;
	v[1]=1;
	for (int i=2;i<=N;++i)
		if (!nprime[i])
		{
			v[i]=i;
			for (int j=(i<<1);j<=N;j+=i)
			{
				nprime[j]=1;
				if (!v[j]) v[j]=i;
			}
		}
	T=read();
	while (T--)
	{
		n=read(),m=read(),res=1ll*n*m,ans=inf,rt=length=length2=0;
		for (int i=1;1ll*i*i<=res;++i)
			if (i!=n&&i!=m&&res%i==0&&i+res/i<ans)
				ans=i+res/i,rt=i;
		if (rt)
		{
			x=gcd(rt,n),y=rt/x,length=length2=0;
			for (int i=0;i<x;++i)
				for (int j=0;j<y;++j)
					tong[++length]=i+j+1;
			for (int i=0;i<n/x;++i)
				for (int j=0;j<m/y;++j)
					tong2[++length2]=x*i+y*j+1;
			printf("%d ",length);
			for (int i=1;i<=length;++i) printf("%d ",tong[i]);
			puts("");
			printf("%d ",length2);
			for (int i=1;i<=length2;++i) printf("%d ",tong2[i]);
			puts("");
		}
		else
		{
			d=v[gcd(n,m)],length=length2=0;
			if (d!=1&&(d!=n||d!=m))
			{
				for (int i=0;i<n/d;++i)
					for (int j=0;j<d;++j)
						tong[++length]=i*d+j*(m/d)+1;
				for (int i=0;i<m/d;++i)
					for (int j=0;j<d;++j)
						tong2[++length2]=i+j+1;
				printf("%d ",length);
				for (int i=1;i<=length;++i) printf("%d ",tong[i]);
				puts("");
				printf("%d ",length2);
				for (int i=1;i<=length2;++i) printf("%d ",tong2[i]);
				puts("");
			}
			else if (n<m)
			{
				for (int i=0;i<n;++i) tong[++length]=i+1,tong[++length]=i+1;
				for (int i=0;i<m;++i) tong2[++length2]=i+1;
				printf("%d ",length);
				for (int i=1;i<=length;++i) printf("%d ",tong[i]);
				puts("");
				printf("%d ",length2);
				for (int i=1;i<=length2;++i) printf("%d ",tong2[i]);
				puts("");
			}
			else
			{
				printf("%d\n",n+(m<<1));
				for (int i=0;i<n;++i) tong[++length]=i+1;
				for (int i=0;i<m;++i) tong2[++length2]=i+1,tong2[++length2]=i+1;
				printf("%d ",length);
				for (int i=1;i<=length;++i) printf("%d ",tong[i]);
				puts("");
				printf("%d ",length2);
				for (int i=1;i<=length2;++i) printf("%d ",tong2[i]);
				puts("");
			}
		}
	}
	return 0;
}