#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int T; cin >> T;
    rep(_,T){
        ll a, b;
        cin >> a >> b;
        if(b - a == 1){
            cout << 1 << endl;
            cout << 1 << endl;
            continue;
        }
        bitset<100> c(a);
        bitset<100> d(b);
        // cout << c << endl << d << endl;

        int ma = 0;
        rep(i,100){
            if(c[i]==0&&d[i]) ma = i;
        }
        // cout << ma << endl;

        vector<ll> ans;
        while(c[ma] == 0){
            rep(i,100){
                if(c[i]){
                    a += 1LL << i;
                    ans.push_back(1LL<<i);
                    bitset<100> cc(a);
                    c = cc;
                    break;
                }
            }
        }

        drep(i,ma){
            if(d[i]){
                ans.push_back(1LL<<i);
            }
        }

        cout << ans.size() << endl;
        rep(i,ans.size()){
            if(i > 0) cout << ' ';
            cout << ans[i];
        }
        cout << endl;
    }
    return 0;
}