#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define  all(x) (x).begin(),(x).end()     // 昇順ソート
#define  rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define  FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) ((int)(x).size())
typedef long long ll;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
template<typename T> void view(T e){std::cout << e << std::endl;}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }

const int inf = 1 << 30;
const ll INF = 1LL << 60;

vector<ll> enumerate_num(ll x){
    vector<ll> res;
    for(ll i = 1; i * i <= x; i++){
        if (x % i == 0){
            res.push_back(i);
            if (i * i != x) res.push_back(x / i);
        }
    }
    sort(all(res));
    return res;
}

int main(){
    int t;
    cin >> t;
    while(t--){
        ll a, b;
        cin >> a >> b;
        VL ans;
        while(2*a <= b){
            ans.push_back(a);
            a *= 2;
        }
        int right = sz(ans) - 1;
        while(right >= 0){
            if (a + ans[right] <= b){
                a += ans[right];
                ans.push_back(ans[right]);
            }else{
                right--;
            }
        }
        while(b != a){
            ll diff = b - a;
            auto res = enumerate_num(diff);
            int usei = 0;
            rep(i, sz(res)){
                if (a % res[i] == 0 && a + res[i] <= b){
                    usei = i;
                    continue;
                }
            }
            a += res[usei];
            ans.push_back(res[usei]);
        }
        view(sz(ans));
        rep(i,sz(ans)) printf("%lld%c", ans[i], i==sz(ans)-1? '\n' : ' ');
    }
    return 0;
}