#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

int main(){
    int T;
    cin >> T;
    while(T--){
        ll A, B;
        cin >> A >> B;
        vector<ll> ans;
        while(A*2 <= B){
            ans.pb(A), A *= 2;
        }
        while(A < B){
            ll s = 1, t = 1;
            while(A%(s*2) == 0) s *= 2;
            ll d = B-A;
            while(d >= t*2) t *= 2;
            if(t <= s) ans.pb(t), A += t;
            else ans.pb(s), A += s;
        }
        cout << sz(ans) << endl;
        for(auto &e: ans) cout << e << ' '; cout << endl;
    }
}