#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);

int main() {
    cin>>Q;
    rep(_, Q){
        cin>>A>>B;
        vec ans(0);
        ll i(1);
        while(A + i <= B){
            if(A&i){
                ans.push_back(i);
                A += i;
            }
            i <<= 1;
        }
        while(i){
            if(A + i <= B){
                ans.push_back(i);
                A += i;
            }
            i >>= 1;
        }
        cout<<ans.size()<<endl;
        rep(j, (int)ans.size()) cout<<ans[j]<<" \n"[j == (int)ans.size() - 1];
    }
}