#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
void solve() {
int n, m;
std::cin >> n >> m;
std::vector<int> ret;
bool swapped = 0;
if (n > m) {
std::swap(n, m);
swapped = 1;
}
if (n == 1 || n == m) {
ret.assign(m-1, -1);
}
else if (n == 2) {
int64_t sum = 0;
for (int i = 0; i < m-(m%2==0); i++) {
ret.emplace_back((i&1) ? -m-1 : m);
sum += ret.back();
}
}
else {
std::vector<int> arr(n, 0);
arr[0] = -2*m;
for (int i = 1; i < n-1; i++) {
arr[i] = 1;
}
arr[n-1] = -(-1 - 2*m + n - 3);
int64_t sum = 0;
for (int i = 0; i < m-(m%n==0); i++) {
ret.emplace_back(arr[i%n]);
sum += ret.back();
}
int cnt = 0;
while (sum - arr[cnt%n] + arr[ret.size()%n] > 0) {
sum -= arr[cnt%n];
sum += arr[ret.size()%n];
ret.emplace_back(arr[ret.size()%n]);
++cnt;
}
}
if (swapped) {
for (auto& i : ret) {
i *= -1;
}
}
std::cout << ret.size() << "\n";
for (const auto& i : ret) {
std::cout << i << " ";
}
std::cout << "\n";
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
int t;
std::cin >> t;
while (t--) {
solve();
}
}
