/*
 * @Author:             cmk666
 * @Created time:       2023-12-21 13:04:50
 * @Last Modified time: 2023-12-21 14:10:22
 */
#pragma GCC optimize("Ofast", "unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include"debug.h"
#else
#define D(...) ((void)0)
#endif
using namespace std; using ll = long long;
#define For(i, j, k) for ( int i = (j) ; i <= (k) ; i++ )
#define Fol(i, j, k) for ( int i = (j) ; i >= (k) ; i-- )
namespace FastIO
{
// ------------------------------
// #define IN_HAS_NEG
// #define OUT_HAS_NEG
// #define CHK_EOF
// #define DISABLE_MMAP
// ------------------------------
#if __cplusplus < 201400
#error Please use C++14 or higher.
#endif
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if ( defined(LOCAL) || defined(_WIN32) ) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include<sys/mman.h>
#endif
#ifdef LOCAL
	inline char gc() { return getchar(); }
	inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
	INLINE_V constexpr int _READ_SIZE = 1 << 18;
	INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr, *_read_ptr_end = nullptr;
	inline char gc()
	{
		if ( __builtin_expect(_read_ptr == _read_ptr_end, false) )
		{
			_read_ptr = _read_buffer;
			_read_ptr_end = _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin);
#ifdef CHK_EOF
			if ( __builtin_expect(_read_ptr == _read_ptr_end, false) ) return EOF;
#endif
		}
		return *_read_ptr++;
	}
#else
	INLINE_V static const char *_read_ptr = (const char *)mmap(nullptr, INT_MAX, 1, 2, 0, 0);
	inline char gc() { return *_read_ptr++; }
#endif
	INLINE_V constexpr int _WRITE_SIZE = 1 << 18;
	INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer;
	inline void pc(char c)
	{
		*_write_ptr++ = c;
		if ( __builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false) )
		{
			fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
			_write_ptr = _write_buffer;
		}
	}
	INLINE_V struct _auto_flush
	{
		inline ~_auto_flush() { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); }
	}	_auto_flush;
#endif
#ifdef CHK_EOF
	inline constexpr bool _isdigit(char c) { return ( c & 16 ) && c != EOF; }
	inline constexpr bool _isgraph(char c) { return c > 32 && c != EOF; }
#else
	inline constexpr bool _isdigit(char c) { return c & 16; }
	inline constexpr bool _isgraph(char c) { return c > 32; }
#endif
	template < class T >
	INLINE_V constexpr bool _is_integer = numeric_limits < T >::is_integer;
	template < class T >
	INLINE_V constexpr bool _is_signed = numeric_limits < T >::is_signed;
	template < class T >
	INLINE_V constexpr bool _is_unsigned = _is_integer < T > && !_is_signed < T >;
	template <> INLINE_V constexpr bool _is_integer < __int128 > = true;
	template <> INLINE_V constexpr bool _is_integer < __uint128_t > = true;
	template <> INLINE_V constexpr bool _is_signed < __int128 > = true;
	template <> INLINE_V constexpr bool _is_unsigned < __uint128_t > = true;
#undef INLINE_V
	inline void read(char &c) { do c = gc(); while ( !_isgraph(c) ); }
	inline void read_cstr(char *s)
	{
		char c = gc(); while ( !_isgraph(c) ) c = gc();
		while ( _isgraph(c) ) *s++ = c, c = gc();
		*s = 0;
	}
	inline void read(string &s)
	{
		char c = gc(); s.clear(); while ( !_isgraph(c) ) c = gc();
		while ( _isgraph(c) ) s.push_back(c), c = gc();
	}
#ifdef IN_HAS_NEG
	template < class T, enable_if_t < _is_signed < T >, int > = 0 >
	inline void read(T &x)
	{
		char c = gc(); bool f = true; x = 0;
		while ( !_isdigit(c) ) { if ( c == 45 ) f = false; c = gc(); }
		if ( f ) while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
		else     while ( _isdigit(c) ) x = x * 10 - ( c & 15 ), c = gc();
	}
	template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
	template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
	inline void read(T &x)
	{
		char c = gc(); while ( !_isdigit(c) ) c = gc();
		x = 0; while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
	}
	inline void write(char c) { pc(c); }
	inline void write_cstr(const char *s) { while ( *s ) pc(*s++); }
	inline void write(const string &s) { for ( char c : s ) pc(c); }
#ifdef OUT_HAS_NEG
	template < class T, enable_if_t < _is_signed < T >, int > = 0 >
	inline void write(T x)
	{
		char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
		if ( x >= 0 )  do buffer[digits++] =  ( x % 10 ) | 48, x /= 10; while ( x );
		else { pc(45); do buffer[digits++] = -( x % 10 ) | 48, x /= 10; while ( x ); }
		while ( digits ) pc(buffer[--digits]);
	}
	template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
	template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
	inline void write(T x)
	{
		char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
		do buffer[digits++] = ( x % 10 ) | 48, x /= 10; while ( x );
		while ( digits ) pc(buffer[--digits]);
	}
	template < int N > struct _tuple_io_helper
	{
		template < class ...T >
		static inline void _read(tuple < T... > &x)
		{ _tuple_io_helper < N - 1 >::_read(x), read(get < N - 1 > (x)); }
		template < class ...T >
		static inline void _write(const tuple < T... > &x)
		{ _tuple_io_helper < N - 1 >::_write(x), pc(32), write(get < N - 1 > (x)); }
	};
	template <> struct _tuple_io_helper < 1 >
	{
		template < class ...T >
		static inline void _read(tuple < T... > &x) { read(get < 0 > (x)); }
		template < class ...T >
		static inline void _write(const tuple < T... > &x) { write(get < 0 > (x)); }
	};
	template < class ...T >
	inline void read(tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_read(x); }
	template < class ...T >
	inline void write(const tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_write(x); }
	template < class T1, class T2 >
	inline void read(pair < T1, T2 > &x) { read(x.first), read(x.second); }
	template < class T1, class T2 >
	inline void write(const pair < T1, T2 > &x) { write(x.first), pc(32), write(x.second); }
	template < class T1, class ...T2 >
	inline void read(T1 &x, T2 &...y) { read(x), read(y...); }
	template < class ...T >
	inline void read_cstr(char *x, T *...y) { read_cstr(x), read_cstr(y...); }
	template < class T1, class ...T2 >
	inline void write(const T1 &x, const T2 &...y) { write(x), write(y...); }
	template < class ...T >
	inline void write_cstr(const char *x, const T *...y) { write_cstr(x), write_cstr(y...); }
	template < class T >
	inline void print(const T &x) { write(x); }
	inline void print_cstr(const char *x) { write_cstr(x); }
	template < class T1, class ...T2 >
	inline void print(const T1 &x, const T2 &...y) { print(x), pc(32), print(y...); }
	template < class ...T >
	inline void print_cstr(const char *x, const T *...y) { print_cstr(x), pc(32), print_cstr(y...); }
	inline void println() { pc(10); }
	inline void println_cstr() { pc(10); }
	template < class ...T >
	inline void println(const T &...x) { print(x...), pc(10); }
	template < class ...T >
	inline void println_cstr(const T *...x) { print_cstr(x...), pc(10); }
}
using namespace FastIO;
struct poly
{
	vector < int > f;
	inline poly(int n, int v = 0) : f(n, v) {}
	inline int &operator[](int x) { return f[x]; }
	inline poly &rsz(int n) { f.resize(n); return *this; }
	inline poly &skp(int x)
	{
		for ( int i = 0 ; i < (int)f.size() ; i += x ) f[i] = 1;
		return *this;
	}
	inline poly &mul(int x)
	{
		Fol(i, (int)f.size() - 1, x) f[i] -= f[i - x];
		For(i, 1, (int)f.size() - 1) f[i] += f[i - 1];
		return *this;
	}
	inline poly &div(int x)
	{
		Fol(i, (int)f.size() - 1, 1) f[i] -= f[i - 1];
		For(i, x, (int)f.size() - 1) f[i] += f[i - x];
		return *this;
	}
	inline void out()const
	{
		write(accumulate(f.begin(), f.end(), 0));
		For(i, 0, (int)f.size() - 1) For(j, 1, f[i]) write(' ', i + 1);
		println();
	}
}; int n, m, p, q; ll o;
inline auto factorize(int x)
{
	vector < pair < int, int > > ret;
	for ( int i = 2 ; i * i <= x ; i++ ) if ( !( x % i ) )
		for ( ret.emplace_back(i, 1) ; !( ( x /= i ) % i ) ; ret.back().second++ );
	if ( x > 1 ) ret.emplace_back(x, 1);
	return ret;
}
inline void work()
{
	read(n, m);
	if ( n > m ) swap(n, m);
	Fol(i, (int)sqrtl((ll)n * m), n + 1) if ( !( (ll)n * m % i ) )
	{
		q = __gcd(i, m), p = (ll)n * q / i,
		poly(n, 1).rsz(n + m).div(p).mul(q).out(), poly(m, 1).div(q).mul(p).out(); return;
	}
	if ( n == 1 ) { poly(n, 2).out(), poly(m, 1).out(); return; }
	auto fn = factorize(n);
	if ( (int)fn.size() > 1 )
	{
		p = fn[0].first, q = fn[1].first, poly(n).skp(p * q).mul(p).mul(q).out(),
		poly(p * q).skp(p).div(q).rsz(m + p * q).mul(m).out(); return;
	}
	auto fm = factorize(m);
	if ( (int)fm.size() > 1 && fm[0].first * fm[1].first <= n )
	{
		p = fm[0].first, q = fm[1].first, poly(m).skp(p * q).mul(p).mul(q).out(),
		poly(p * q).skp(p).div(q).rsz(n + p * q).mul(n).out(); return;
	}
	auto [pn, cn] = fn[0];
	for ( auto [pm, cm] : fm ) if ( pn == pm && ( cn > 1 || cm > 1 ) )
	{
		poly f(( cn < cm ? n : m ) * pn);
		for ( int i = 0 ; i < ( cn < cm ? n : m ) ; i += pn ) For(j, 0, pn - 1) f[i + j * pn]++;
		f.out(), poly(cn > cm ? n : m).skp(pn * pn).mul(pn).mul(pn).out(); return;
	}
	if ( (int)fm.size() > 1 )
	{
		poly f(m); p = fm[0].first, q = fm[1].first, f.skp(q).rsz(n + m).div(p).mul(n);
		if ( *min_element(f.f.begin(), f.f.end()) >= 0 )
		{
			poly g(m); For(i, 0, p - 1) For(j, 0, q - 1) g[i + j]++;
			f.out(), g.out(); return;
		}
	}
	Fol(i, n - 1, 1) if ( !( (ll)n * m % i ) )
	{
		if ( ( o = (ll)n * m / i ) + i >= n + n + m ) break;
		p = __gcd(n, (int)o), q = (ll)m * p / o,
		poly(n, 1).div(p).mul(q).out(), poly(m, 1).rsz(m + p).div(q).mul(p).out(); return;
	}
	poly(n, 2).out(), poly(m, 1).out();
}
int main() { int t; read(t); For(tt, 1, t) work(); return 0; }
// 想上GM捏 想上GM捏 想上GM捏 想上GM捏 想上GM捏
// 伊娜可爱捏 伊娜贴贴捏