// #include "pch.h"
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <stack>
#include <random>

typedef long long ll;
typedef std::pair<int, int> Pii;
typedef std::pair<long long, long long> Pll;
typedef std::pair<double, double> Pdd;

#define rip(i, n, s) for (int i = (s);i < (int)( n ); i++)
#define all(a) a.begin(), a.end()
#define MM << " " <<

template<typename T>
using MaxHeap = std::priority_queue<T>;
template<typename T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;

template<typename T>
inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T>
inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
void vdeb(std::vector<T> &bb) {
    for (int i = 0;i < bb.size();i++) {
        if (i == bb.size() - 1) std::cout << bb[i];
        else std::cout << bb[i] << ' ';
    }
    std::cout << '\n';
}
template<typename T>
void vdeb(std::vector<std::vector<T>> &bb) {
    for (int i = 0;i < bb.size();i++) {
        std::cout << i << ' ';
        vdeb(bb[i]);
    }
    std::cout << '\n';
}

using namespace std;

void solve(vector<ll> &da){
    ll a,b; cin >> a >> b;
    ll c = b-a, now = 1;
    while(a%now == 0) {
        now*=2;
    }
    now/=2;
    while(c) {
        if(c <= now) {
            while(c < now) {
                now /= 2;
            }
            da.push_back(now);
            c -= now;
        }
        else {
            da.push_back(now);
            c -= now;
            now *= 2;
        }
    }
}

int main() {
    int t; cin >> t;
    vector<vector<ll>> da(t, vector<ll>(0));
    rip(i,t,0) {
        solve(da[i]);
    }
    rip(i,t,0) {
        cout << da[i].size() << endl;
        vdeb(da[i]);
    }
}