#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}

int main() {
	int T;
	cin >> T;
	while (T--) {
		ll A, B;
		scanf("%lld %lld", &A, &B);
		ll g = gcd(A, B);
		vector<ll> ans, ansb;
		while (A != B) {
			if (A / g & 1) { ans.emplace_back(g); A += g; }
			if (B / g & 1) { ansb.emplace_back(g); B -= g; }
			g *= 2;
		}
		for (int i = ansb.size(); i > 0; --i) ans.emplace_back(ansb[i - 1]);
		printf("%d\n", ans.size());
		REP(i, ans.size()) printf("%lld%c", ans[i], " \n"[i + 1 == ans.size()]);
	}
}