#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 = 3e5 + 5;
const ll M = 1e8;
const ll inf = 1e3;
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); }
ll n, m;
vector <ll> res;
bool ok = 0;
void rec(ll pos) {
if (ok) return;
if (pos == max(n, m)) {
for (int i = 0; i < res.sz; ++ i) {
ll sum = 0;
for (int j = i; j < min(ll(res.sz), i + n); ++ j) sum += res[j];
if (i + n < res.sz) {
if (sum >= 0) return;
}
sum = 0;
for (int j = i; j < min(ll(res.sz), i + m); ++ j) sum += res[j];
if (i + m < res.sz) {
if (sum <= 0) return;
}
}
cout << max(n, m) << "\n";
for (auto x : res) cout << x << " ";
cout << "\n";
ok = 1;
return;
}
res.pb(1);
rec(pos + 1);
res.pop_back();
res.pb(-1);
rec(pos + 1);
res.pop_back();
}
const void solve(/*Armashka*/) {
cin >> n >> m;
ok = 0;
res.clear();
if (max(n, m) % min(n, m) == 0 || n % 2 == m % 2) {
ll len = max(n, m) - 1;
cout << len << "\n";
for (int i = 1; i <= len; ++ i) {
if (min(n, m) == n) cout << -i << " ";
else cout << i << " ";
}
cout << "\n";
} else {
if (max(n, m) <= 10) {
rec(0);
return;
}
cout << max(n, m) << "\n";
if (n % 2) {
ll a = (n + 2) / 2, b = (n + 2 - a);
for (int i = 1; i < max(n, m); i += 2) {
cout << -a << " " << b << " ";
}
cout << -a << "\n";
} else {
ll a = (m + 2) / 2, b = (m + 2 - a);
for (int i = 1; i < max(n, m); i += 2) {
cout << a << " " << -b << " ";
}
cout << a << "\n";
}
}
}
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
*/
