#include <bits/stdc++.h>
using namespace std;

#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second

using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;

const double eps = 1e-10;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
	return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
	for(auto &e:u) fill_v<T>(e,v...);
}

void solve() {
  int64 A, B;
  cin >> A >> B;
  int64 bit_A = 0, bit_B = 0;
  while ((1LL << bit_A) <= A) bit_A++;
  while ((1LL << bit_B) <= B) bit_B++;
  vector<int64> res;
  int64 bit_sa = bit_B-bit_A;
  int64 B_ = B >> bit_sa;
  if (B_ < A) {
    REP(i, bit_A) {
      if (A >> i & 1) {
        res.push_back(1LL << i);
        A += 1LL << i;
      }
    }
    bit_sa--;
  }
  REP(i, bit_sa) {
    res.push_back(A);
    A *= 2;
  }
  REP(i, bit_B) {
    if ((A >> i & 1) && !(B >> i & 1)) {
      res.push_back(1LL << i);
      A += (1LL << i);
    }
  }
  for (int64 i = bit_B-1; i >= 0; i--) {
    if (!(A >> i & 1) && (B >> i & 1)) {
      res.push_back(1LL << i);
      A += (1LL << i);
    }
  }
  cout << res.size() << endl;
  REP(i, res.size()) {
    cout << res[i] << " ";
  }
  cout << endl;
}

int main() {
  int64 T;
  cin >> T;
  REP(_, T) {
    solve();
  }
}