#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 47
#endif
bool check(int n, int m, vector<int> a) {
int s = 0;
int k = a.size();
vector<int> p(k + 1);
for (int i = 0; i < k; i++) {
p[i + 1] = p[i] + a[i];
}
for (int i = 0; i + n <= k; i++) {
if (p[i + n] - p[i] >= 0) return false;
}
for (int i = 0; i + m <= k; i++) {
if (p[i + m] - p[i] < 0) return false;
}
return true;
}
void solve() {
int n, m;
cin >> n >> m;
bool is = false;
if (n > m) {
is = true;
swap(n, m);
}
vector<int> ans;
if (m % n == 0) {
for (int i = 0; i < m - 1; i++) {
ans.push_back(-1);
}
} else if (n == 2) {
int k = 1e6;
for (int i = 0; i < m - 1; i += 2) {
ans.push_back(k);
ans.push_back(-k - 1);
}
ans.push_back(k);
} else if (m - n <= 2) {
for (int i = 1; i < n; i++) {
ans.push_back(2);
}
ans.push_back(-n * 2 + 1);
for (int i = 1; i < n; i++) {
ans.push_back(2);
}
}
assert(check(n, m, ans));
if (is) {
for (int &x : ans) {
x *= -1;
}
}
cout << ans.size() << '\n';
for (int x : ans) {
cout << x << ' ';
}
cout << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
