#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

ll N;
int K;
ll A[100];

void solve(){
    ll a, b; cin >> a >> b;
    vector<ll> ans;
    
    ll m = (a^b)&b;
    ll x = 0;
    for(int i = 60; i >= 0; i--){
        if(m&((ll)1<<i)){
            x = i;
            break;
        }
    }
    if(a%2 == 0){
        a++;
        ans.push_back(1);
    }
    for(int i = 0; i < x; i++){
        if(a&((ll)1<<i)){
            a += ((ll)1<<i);
            ans.push_back((ll)1<<i);
        }
    }
    for(int i = x-1; i >= 0; i--){
        if(b&((ll)1<<i)){
            ans.push_back((ll)1<<i);
        }
    }
    cout << ans.size() << endl;
    for(ll i : ans) cout << i << ' ';
    cout << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int t; cin >> t;
    for(int i = 0; i < t; i++) solve();
    cout << ((ll)1<<60) << endl;
}