#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while(T-- > 0){
        ll A, B;
        cin >> A >> B;
        if(A == B){
            cout << 0 << "\n\n";
            continue;
        }
        int ub = 0;
        for(int k = 60; k >= 0; --k){
            if(!(A >> k & 1) && (B >> k & 1)){
                ub = k;
                break;
            }
        }
        vector<ll> ans;
        for(int k = 0; k < ub; ++k){
            if(A >> k & 1){
                ans.emplace_back(1LL << k);
                A += ans.back();
            }
        }
        for(int k = ub - 1; k >= 0; --k){
            if(B >> k & 1){
                ans.emplace_back(1LL << k);
            }
        }
        int n = ans.size();
        cout << n << '\n';
        for(int i = 0; i < n; ++i){
            cout << ans[i];
            cout << ((i == n - 1) ? '\n' : ' ');
        }
    }

    return 0;
}