#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
template <class T>
void get_unique(vector<T>& x) {
    x.erase(unique(x.begin(), x.end()), x.end());
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
    for (int i = 0; i < sz(v); i++) {
        os << v[i];
        if (i < sz(v) - 1) os << " ";
    }
    return os;
}
int main() {
    int tt;
    cin >> tt;
    while (tt--) {
        vector<ll> ans;
        ll a, b;
        cin >> a >> b;
        ll x = 1;
        while ((x << 1) <= b) x <<= 1;
        while (a < x) {
            rep(d, 62) {
                if (a >> d & 1) {
                    a += (1ll << d);
                    ans.push_back(1ll << d);
                    break;
                }
            }
        }
        assert(a == x);
        b -= a;
        rep(d, 62) if (b >> d & 1) ans.push_back(1ll << d);
        assert(sz(ans) <= 120);
        cout << sz(ans) << '\n' << ans << '\n';
    }
}