#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) {
            os << ',';
        }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//-------------------------------------

struct FastFactorize {
    ll mul(ll a, ll b, ll c) { return (__int128)a * b % c; }
    ll power(ll a, ll b, ll mod) {
        ll res = 1;
        while(b) {
            if(b & 1) {
                res = mul(res, a, mod);
            }
            a = mul(a, a, mod);
            b >>= 1;
        }
        return res;
    }
    bool isPrime(ll n) {
        if(!(n & 1) && n != 2) {
            return false;
        }
        ll d = n - 1;
        int s = __builtin_ctzll(d);
        d >>= s;
        vector<int> A;
        if(n <= 1000000000) {
            A = {2, 3, 5, 7};
        } else {
            A = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
        }
        for(int a : A) {
            ll p = power(a, d, n);
            int i = s;
            while(p != 1 && p != n - 1 && a % n && (--i)) {
                p = mul(p, p, n);
            }
            if(p != n - 1 && i != s) {
                return false;
            }
        }
        return true;
    }
    ll rho(ll n) {
        auto f = [&](ll a) { return mul(a, a, n) + 1; };
        ll x = 0, y = 0, p = 2, q;
        int i = 1, t = 0;
        while((t++) % 40 || gcd(p, n) == 1) {
            if(x == y) {
                x = ++i;
                y = f(x);
            }
            if(q = mul(p, abs(y - x), n)) {
                p = q;
            }
            x = f(x);
            y = f(f(y));
        }
        return gcd(p, n);
    }
    vector<ll> factor(ll n) {
        if(n == 1) {
            return {};
        }
        if(isPrime(n)) {
            return {n};
        }
        ll a = rho(n);
        assert(a != n && a != 1);
        auto l = factor(a), r = factor(n / a);
        l.insert(l.end(), r.begin(), r.end());
        return l;
    }
};

vector<ll> divisor(ll n) {
    FastFactorize f;
    auto v = f.factor(n);
    sort(v.begin(), v.end());
    map<ll, vector<ll>> mp;
    ll now = 0;
    ll tmp = 0;
    vector<ll> ls;
    for(auto i : v) {
        if(now != i) {
            tmp = 1;
            now = i;
            ls.push_back(now);
            mp[now].push_back(1);
        }
        tmp *= i;
        mp[now].push_back(tmp);
    }
    vector<ll> div;
    function<void(int, ll)> calc = [&](int cur, ll val) {
        if(cur == mp.size()) {
            div.push_back(val);
            return;
        }
        for(auto i : mp[ls[cur]]) {
            calc(cur + 1, val * i);
        }
    };
    calc(0, 1);
    sort(div.begin(), div.end());
    div.erase(unique(div.begin(), div.end()), div.end());
    return div;
}

void solve() {
    ll a, b;
    cin >> a >> b;

    ll now = a;
    vector<ll> ans;

    while(now < b) {
        auto y = divisor(now);
        auto it = upper_bound(ALL(y), b - now);
        if(it != y.begin()) {
            it--;
        }
        ans.emplace_back(*it);
        now += *it;
    }

    assert(now == b);
    assert((int)ans.size() <= 120);

    cout << ans.size() << "\n";
    for(int i = 0; i < (int)ans.size(); i++) {
        cout << ans[i] << " \n"[i + 1 == (int)ans.size()];
    }
}

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