#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);
	}
}
void solve(){
	cin >> n >> m;
	if(n>m) swap(n,m);
	ll xs=n;
	for(ll s=n+1; s<=m ;s++){
		if(s*s>n*m) break;
		if(n*m%s==0) xs=s;
	}
	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;
		}
	}
	vector<pair<ll,ll> >gl,gr;
	for(auto c:gn){
		if(xs%c.fi==0){
			xs/=c.fi;
			gl.push_back(c);
		}
		else gr.push_back(c);
	}
	v.clear();
	//for(auto c:) cout << c.fi << ' ' << c.se << endl;
	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();
}