#include<iostream>
#include<cstdio>
#define N 3000000
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],F[N+1],tong[N+1],tong2[N+1],length,length2;
bool nprime[N+1];
long long res,ans;
int main()
{
	int rt,x,y,a,b;
	T=read();
	while (T--)
	{
		n=read(),m=read(),res=1ll*n*m,ans=n+m+min(n,m),rt=a=b=x=y=length=length2=0;
		for (int i=2;i<=n-1;++i)
			if (n%i==0)
			{
				for (int j=0;j<n/i;++j)
					if (1ll*i*j<=m&&(m-i*j)%(n/i)==0)
						ans=n+m,a=i,b=n/i;
			}
		for (int i=2;i<=m-1;++i)
			if (m%i==0)
			{
				for (int j=0;j<m/i;++j)
					if (1ll*i*j<=n&&(n-i*j)%(m/i)==0)
						ans=n+m,a=i,b=m/i;
			}
		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;
			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;
		}
		else if (a)
		{
			for (int i=0;i<a;++i)
				for (int j=0;j<b;++j)
					tong[++length]=i+j+1;
			for (int i=0;i<=n+m;++i) F[i]=0;
			F[0]=1,F[n]=-1,F[m]-=1,F[n+m]=1;
			for (int i=a;i<=n+m;++i) F[i]+=F[i-a];
			for (int i=b;i<=n+m;++i) F[i]+=F[i-b];
			for (int i=0;i<=n+m;++i)
				for (int j=1;j<=F[i];++j)
					tong2[++length2]=i+1;
		}
		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;
			}
			else
			{
				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;
}