/*
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;
inline void work(int x, int y, int a, int b)
{
	printf("%lld ", a);
	L(i, 1, a) printf("%lld ", i); puts("");
	printf("%lld ", b);
	int nw = 1;
	L(i, 1, b / y)
	{
		L(j, 1, y) printf("%lld ", nw + j - 1);
		nw += a;
	}
	puts(""); return ;
}
inline void solve()
{
	x = read(), y = read();
	int t = x * y, f = sqrt(t);
	R(i, f, 1)
	{
		if(t % i != 0) continue;
		int a = i, b = t / i;
		if(x % a == 0) {work(x, y, a, b); return ;}
		if(y % a == 0) {swap(x, y), work(x, y, a, b); return ;}
		if(x % b == 0) {swap(a, b), work(x, y, a, b); return ;}
		if(y % b == 0) {swap(a, b), swap(x, y); work(x, y, a, b); return ;}
	}
	puts("0"); puts("0");
	return ;
}
signed main()
{
	T = read();
	L(i, 1, T) solve();
	return 0;
}