#include<bits/stdc++.h>
#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 ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
#define i128 __int128
using namespace std;
const int N = 1 << 21;
const ll mod = (ll) 998244353 * 1019260817, base = 19491001;

int n, m;

pair < vi, vi > DV(int x, int y) {
	vi ls, rs;
	L(i, 0, x - 1) 
		ls.emplace_back(i * y);
	L(i, 0, y - 1) 
		rs.emplace_back(i);
	return make_pair(ls, rs);
}

vi Mul(vi a, vi b) {
	vi c;
	for(auto&u : a) 
		for(auto&v : b)
			c.emplace_back(u + v);
	sort(c.begin(), c.end());
	return c; 
}
void Main() {
	cin >> n >> m;
	ll mul = (ll) n * m;
	ll ptl = 0, ptr = 0;
	L(i, 1, sqrt(mul)) 
		if(mul % i == 0) 
			ptl = i, ptr = mul / i;
	ll A = -1, B = -1, C = -1, D = -1;
	L(a, 1, ptl) 
		if(ptl % a == 0 && n % a == 0) {
			ll b = n / a;
			if(ptl % a == 0) {
				ll c = ptl / a;
				if(m % c == 0) {
					A = a;
					B = b;
					C = c;
					D = m / c;
				}
			}
		}
	auto p1 = DV(A, B);
	auto p2 = DV(C, D);
	auto T1 = Mul(p1.first, p2.first);
	auto T2 = Mul(p1.second, p2.second);
	cout << sz(T1) << ' ';
	for(auto&x : T1) 
		cout << x + 1 << ' ';
	cout << '\n';
	cout << sz(T2) << ' ';
	for(auto&x : T2) 
		cout << x + 1 << ' ';
	cout << '\n' << '\n';
}
int main () {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int t; cin >> t; while(t--) Main();
	return 0;
}