/*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << "\n"

void solve(){
    ll A,B;
    cin >> A >> B;
    ll k = 0;
    vector<ll> v;
    ll keta = 0, cur = 1;
    while(true){
        if(A + cur > B){
            break;
        }else{
            if(A % (cur*2) != 0){
                A += cur;
                k++;
                v.push_back(cur);
            }
            cur *= 2;
            keta++;
        }
    }
    rrep(i,keta, 0){
        if((B>>i)&1){
            if(not ((A>>i)&1)){
                k++;
                v.push_back(1LL<<i);
            }
        }
    }
    print(k);
    printa(v, k);


}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll t;
    cin >> t;
    while(t--) solve();
}