#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

void solve(){
    ll a, b;
    cin >> a >> b;
    vector<ll> l, r;
    while(a != b){
        ll g = __gcd(a, b);
        if(a/g%2) l.emplace_back(g), a += g;
        if(b/g%2) r.emplace_back(g), b -= g;
    }
    for (int i = (int)r.size()-1; i >= 0; --i) l.emplace_back(r[i]);\
    cout << l.size() << "\n";
    for (int i = 0; i < l.size(); ++i) {
        if(i) printf(" ");
        printf("%lld", l[i]);
    }
    puts("");
}

int main() {
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}