#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const int N=1e6+5;
const int iu=1e6;
vector<int>pf[N];
ll n,m;
vector<ll>v;
void gen(vector<pair<ll,ll> >&g,int id,ll cur){
	if(id==g.size()){
		v.push_back(cur);
		return;
	}
	for(int i=0; i<g[id].fi ;i++){
		ll dx=i*g[id].se;
		gen(g,id+1,cur+dx);
	}
}
ll gcd(ll x,ll y){
	if(y==0) return x;
	return gcd(y,x%y);
}
void solve(){
	cin >> n >> m;
	if(n>m) swap(n,m);
	if(n==1 && pf[m].size()<=1){
		cout << "0\n0\n";
		return;
	}
	ll xs=n;
	for(ll s=n+1; s<=m ;s++){
		if(s*s>n*m) break;
		if(n*m%s==0) xs=s;
	}
	ll g=gcd(n,m);
	if(n==m && pf[n].size()==1) g=1;
	vector<pair<ll,ll> >gl,gr;
	if(xs==n && g!=1){
		ll p=pf[g][0];
		for(int i=0; i<pf[n].size() ;i++){
			if(pf[n][i]==p){
				swap(pf[n][0],pf[n][i]);
				break;
			}
		}
		{
			ll step=1;
			for(auto c:pf[n]){
				gl.push_back({c,step});
				step*=c;
			}
		}
		for(int i=0; i<pf[m].size() ;i++){
			if(pf[m][i]==p){
				swap(pf[m][0],pf[m][i]);
				break;
			}
		}
		swap(pf[m][0],pf[m].back());
		{
			ll step=1;
			for(auto c:pf[m]){
				gr.push_back({c,step});
				step*=c;
			}
		}
		swap(gl[0],gr.back());
	}
	else{
		if(xs==n){
			xs--;
			while(n*m%xs!=0) --xs;
		}
		vector<pair<ll,ll> >gn;
		{
			ll step=1;
			for(auto c:pf[n]){
				gn.push_back({c,step});
				step*=c;
			}
		}
		{
			ll step=1;
			for(auto c:pf[m]){
				gn.push_back({c,step});
				step*=c;
			}
		}
		for(auto c:gn){
			if(xs%c.fi==0){
				xs/=c.fi;
				gl.push_back(c);
			}
			else gr.push_back(c);
		}
	}
	
	v.clear();
	gen(gl,0,0);
	cout << v.size() << ' ';
	for(auto c:v) cout << c+1 << ' ';
	cout << '\n';
	v.clear();
	gen(gr,0,0);
	cout << v.size() << ' ';
	for(auto c:v) cout << c+1 << ' ';
	cout << '\n';
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	for(int i=2; i<=iu ;i++){
		if(!pf[i].empty()) continue;
		for(int j=i; j<=iu ;j+=i){
			int z=j;
			while(z%i==0){
				z/=i;
				pf[j].push_back(i);
			}
		}
	}
	int t;cin >> t;
	while(t--) solve();
}