#include <bits/stdc++.h>
#define fr(x, l, r) for (int x = l; x <= r; x++)
#define rf(x, l, r) for (int x = l; x >= r; x--)
#define fe(x, y) for (auto& x : y)
#define fi first
#define se second
#define m_p make_pair
#define pb push_back
#define pw(x) (ll(1) << ull(x))
#define all(x) (x).begin(), x.end()
#define sz(x) (int)x.size()
#define mt make_tuple
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
template <typename T>
using ve = vector<T>;
template <typename T>
bool umn(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <typename T>
bool umx(T& a, T b) {return a < b ? a = b, 1 : 0;}
const ll OO = 1e18;
const int oo = 1e9;
const int mod = 1e9 + 7;
const int P = 29;
const ld eps = 0.00000001;
const int N = 1e6 + 10;
const bool TEST = 1;
void precalc() {}
int G[N][10];
int sz[N];
int a[N];
int sz_A;
bool vis[N];
int ptr[N];
void dfs(int v) {
stack <int> st;
st.push(v);
while (sz(st)) {
int v = st.top();
vis[v] = 1;
while(ptr[v] < sz[v] && vis[G[v][ptr[v]]]) ptr[v]++;
if (ptr[v] == sz[v]) {
a[sz_A++] = v;
st.pop();
continue;
} else {
st.push(G[v][sz[v] - 1]);
ptr[v]++;
continue;
}
}
return;
vis[v] = 1;
fr(i, 0, sz[v] - 1) if (!vis[G[v][i]]) dfs(G[v][i]);
a[sz_A++] = v;
}
int cnt(int v) {
vis[v] = 1;
int res = 1;
fr(i, 0, sz[v] - 1) if (!vis[G[v][i]]) {
return 2;
}
return res;
}
bool can(int n, int m, int k) {
fr(i, 0, k) {
sz[i] = 0;
ptr[i] = 0;
}
sz_A = 0;
fr(i, 0, k) vis[i] = 0;
fr(i, 1, k) {
if (i + n - 1 <= k) G[i + n - 1][sz[i + n - 1]++] = (i - 1);
if (i + m - 1 <= k) G[i - 1][sz[i - 1]++] = (i + m - 1);
}
fr(i, 0, k) if (!vis[i]) dfs(i);
fill(vis, vis + k + 1, 0);
fr (i, 0, k) {
int x = cnt(a[i]);
if (x > 1) return 0;
}
return 1;
}
int pr[N];
int A[N];
void solve(int TST) {
int n, m;
cin >> n >> m;
int l = max(n, m) - 1;
int r = 2 * max(n, m);
while(l < r) {
int tm = (l + r + 1) >> 1;
if (can(n, m, tm)) l = tm;
else r = tm - 1;
}
fr(i, 0, l) {
sz[i] = 0;
ptr[i] = 0;
}
sz_A = 0;
fr(i, 0, l) vis[i] = 0;
fr(i, 1, l) {
if (i + n - 1 <= l) G[i + n - 1][sz[i + n - 1]++] = (i - 1);
if (i + m - 1 <= l) G[i - 1][sz[i - 1]++] = (i + m - 1);
}
fr(i, 0, l) if (!vis[i]) dfs(i);
reverse(a, a + sz_A);
int cnt = 0;
fr (i, 0, sz_A - 1) pr[a[i]] = cnt++;
fr(i, 1, l) A[i] = pr[i] - pr[i - 1];
cout << l << endl;
fr(i, 1, l) cout << A[i] << ' ';
cout << endl;
}
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int q = 1;
if (TEST) cin >> q;
precalc();
for (int z = 1; z <= q; z++) {
solve(z);
}
return 0;
}
