#include <cstdio>
#include <algorithm>
#include <iostream>

using namespace std;

typedef long long ll;

const int N = 3e6 + 500;

int tmp[N], odg[N], cnt[N], out = 0, in = 0;

void solve(){
	int n, m; cin >> n >> m;
	if(n < m) swap(n, m);
	ll fak = (ll)n * m;
	int f1 = -1, f2;
	for(ll i = 1;i * i <= fak;i++) {
		if(fak % i == 0 && i != m) f1 = i;
	}
	f2 = fak / f1;
	int pos = 0;
	if(f1 == -1 || f1 + f2 > n + 2 * m) {
		f1 = m, f2 = n, pos = 1;
	}
	for(int i = 2;i <= n + m;i++)
		cnt[i] = min(i - 1, n) - max(i - m, 1) + 1;
	if(!pos) {
		cout << f1 << ' ';
		for(int i = 0;i < f1;i++) cout << i + 1 << ' ';
	} else {
		cout << 2 * f1 << ' ';
		for(int i = 0;i < f1;i++) cout << i + 1 << ' ' << i + 1 << ' ';
	}
	cout << '\n' << f2 << ' ';
	int cur = 0, sad = 1;
	for(int i = 0;i < f2;i++) {
		while(cur == cnt[sad]) {
			sad++; cur -= tmp[sad];
		}
		cout << sad - 1 << ' ';
		cur++; tmp[sad + f1]++;
	}
	cout << '\n';
	for(int i = 0;i <= n + m + 100;i++) tmp[i] = 0, odg[i] = 0, cnt[i] = 0;
	out += f1 + f2; in += n;
	//cout << n << " " << m << " 		" << f1 << " " << f2 << endl;
	//if(f1 + f2 >= n + m) cout << "kurcina\n";
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	int T; cin >> T;
	for(;T--;) {
		//printf("T = %d\n", T);
		solve();
	}
	//cout << in << endl;
	//cout << out << endl;
}