#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
using ll=long long;
typedef pair<int, int> P;
void solve(ll a, ll b){
    int t=-1;
    for(int i=59; i>=0; i--){
        if((a&(1ll<<i))!=(b&(1ll<<i))){
            t=i; break;
        }
    }
    bool myon=0;
    vector<ll> ans;
    for(int i=0; i<t; i++){
        if(a&(1ll<<i)){
            a+=(1ll<<i);
            myon=1;
            ans.push_back(1ll<<i);
        }
    }
    if(!myon){
        ans.push_back(1<<t);
    }
    for(int i=t-1; i>=0; i--){
        if(b&(1ll<<i)){
            ans.push_back(1ll<<i);
        }
    }
    cout<<ans.size()<<endl;
    for(auto x:ans) cout<<x<<" ";
    cout<<endl;
}
int main()
{
    int t; cin>>t;
    while(t--){
        ll a, b; cin>>a>>b;
        solve(a, b);
    }
    return 0;
}