#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;
	vi fn, fm;
	L(i, 1, n) {
		if(n % i == 0) {
			fn.emplace_back(i);
		}
	}
	L(i, 1, m) {
		if(m % i == 0) {
			fm.emplace_back(i);
		}
	}
	
	i128 mn = 1e36;
	int U = 1, V = 1; 
	for(auto u : fn) {
		for(auto v : fm) {
			int tu = n / u, tv = m / v;
			ll ls = (ll)u * v;
			ll rs = (ll)tu * tv;
			if(ls <= rs) {
				i128 Mul = 
					(i128) ls * (n + m + 2 - tu - tv) + (i128) rs * (tu + tv);
				if(Mul < mn) 
					mn = Mul, U = u, V = v;
			}
		}
	}
	ll u = U, v = V;
	ll tu = n / u, tv = m / v;
//	cout << "mn = " << (ll)mn << ' ' << u << ' ' << v << endl;
	vi A, B, C, D;
	for(int i = 0; i < n; i += tu)
		A.emplace_back(i);
	for(int i = 0; i < tu; i += 1)
		B.emplace_back(i);
	for(int i = 0; i < m; i += tv)
		C.emplace_back(i);
	for(int i = 0; i < tv; i += 1)
		D.emplace_back(i);
	auto T1 = Mul(A, C);
	auto T2 = Mul(B, D);
	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;
}