/*
60 + 0 + 100 + 64 = 224.
*/

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)
#define pb push_back
#define pii pair<int, int>
inline int read()
{
	int sum = 0, nega = 1;
	char ch = getchar();
	while (ch > '9'||ch < '0')
	{
	    if (ch == '-') nega = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') sum = sum * 10 + ch - '0', ch = getchar();
	return sum * nega;
}
const int N = 1e6 + 9, mod = 998244353;
inline void add(int &x, int y) {x = (x + y) % mod;}
inline void del(int &x, int y) {x = (x - y + mod) % mod;}
int T, x, y, siz, a, b;
vector<int> G1, G2, F, tmp;
inline void dfs(int fx, int fy, int fa, int fb, int nw)
{
	if(nw == siz) return ;
	int fac = F[nw];
	if(x % fac != 0 && y % fac != 0) {dfs(fx, fy, fa, fb, nw + 1); return ;}
	if(x % fac != 0) swap(x, y), swap(fx, fy);
	if(a % fac != 0) swap(G1, G2), swap(fa, fb), swap(a, b);
	tmp.clear();
	x /= fac, a /= fac;
	int val = 1;
	L(i, 1, fac)
	{
		for (auto v : G1) tmp.pb(v + val - 1);
		val += fx;
	}
	fx *= fac, fa *= fac; swap(tmp, G1);
//	puts("------------------");
//	for (auto v : G1) cout << v << " "; cout << endl;
//	for (auto v : G2) cout << v << " "; cout << endl;
//	puts("-------------------");
	dfs(fx, fy, fa, fb, nw); return ;
}
inline void work()
{
//	cout << a << " " << b << endl;
	siz = F.size();
	G1.pb(1); G2.pb(1);
	dfs(1, 1, 1, 1, 0);
	printf("%lld ", G1.size());
	for (auto v : G1) printf("%lld ", v); puts("");
	printf("%lld ", G2.size());
	for (auto v : G2) printf("%lld ", v);
	puts(""); return ;
}
inline void solve()
{
	x = read(), y = read();
	int t = x * y, f = sqrt(t);
	G1.clear(), G2.clear(); F.clear(); siz = F.size();
	int ff = t;
	L(i, 2, f)
		if(ff % i == 0)
		{
			F.pb(i);
			while(ff % i == 0) ff /= i;
		}
	if(ff != 1) F.pb(ff);
	R(i, f, 1)
	{
		if(t % i != 0) continue;
		a = i, b = t / i;
		if(a == x || a == y) continue;
		work(); return ;
	}
	puts("0"); puts("0");
	return ;
}
signed main()
{
	T = read();
	L(i, 1, T) solve();
	return 0;
}