#include <cstdio>
#include <algorithm>

using namespace std;

typedef long long ll;

const int N = 2e6 + 500;

int tmp[N], odg[N], cnt[N];

void solve(){
	int n, m; scanf("%d%d", &n, &m);
	if(n < m) swap(n, m);
	ll fak = n * m;
	int f1 = -1, f2;
	for(ll i = 1;i * i <= fak;i++) {
		if(fak % i == 0 && i != m) f1 = i;
	}
	if(f1 == -1) {
		printf("0\n0\n");
		return;
	}
	f2 = fak / f1;
	for(int i = 2;i <= n + m;i++)
		cnt[i] = min(i - 1, n) - max(i - m, 1) + 1;
	printf("%d ", f1);
	for(int i = 0;i < f1;i++) printf("%d ", i + 1);
	printf("\n%d ", f2);
	int cur = 0, sad = 1;
	for(int i = 0;i < f2;i++) {
		while(cur == cnt[sad]) {
			sad++; cur -= tmp[sad];
		}
		printf("%d ", sad - 1);
		cur++; tmp[sad + f1]++;
	}
	printf("\n");
	for(int i = 0;i <= n + m + 100;i++) tmp[i] = 0, odg[i] = 0, cnt[i] = 0;
}

int main(){
	int T; scanf("%d", &T);
	for(;T--;) solve();
}