#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
const int N = 5e5 + 5;
const ll M = 1e8;
const ll inf = 1e9;
const ll mod = 1e9;
const double Pi = acos(-1);
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }
int n, m, used[N], pr[N], len;
vector <int> g[N], order;
bool ok;
void qfs(int v, int mx) {
used[v] = 1;
for (auto to : g[v]) {
if (to > mx || used[to]) continue;
qfs(to, mx);
}
order.pb(v);
}
const void solve(/*Armashka*/) {
cin >> n >> m;
ll len = n + m - 1 - __gcd(n, m);
for (int i = 0; i <= len; ++ i) used[i] = 0;
for (int i = 0; i <= len; ++ i) {
if (i >= n) g[i - n].pb(i);
if (i >= m) g[i].pb(i - m);
}
for (int i = 0; i <= len; ++ i) {
if (!used[i]) qfs(i, len);
}
reverse(all(order));
for (int i = 0; i <= len; ++ i) {
pr[order[i]] = i;
}
cout << len << "\n";
for (int i = 1; i <= len; ++ i) {
cout << -(pr[i] - pr[i - 1]) << " ";
}
cout << "\n";
for (int i = 0; i <= len; ++ i) pr[i] = 0, g[i].clear();
order.clear();
}
signed main() {
fast;
//freopen("divide.in", "r", stdin);
//freopen("divide.out", "w", stdout);
int tt = 1;
cin >> tt;
while (tt --) {
solve();
}
}
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/
