/* -*- coding: utf-8 -*-
 *
 * 1243.cc:  No.1243 約数加算 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_K = 200;
const int BN = 60;

/* typedef */

typedef long long ll;

/* global variables */

ll xs[MAX_K];

/* subroutines */

template <typename T>
T gcd(T m, T n) {  // m > 0, n > 0
  if (m < n) swap(m, n);
  while (n > 0) {
    T r = m % n;
    m = n;
    n = r;
  }
  return m;
}

/* main */

int main() {
  int tn;
  scanf("%d", &tn);

  while (tn--) {
    ll a, b;
    scanf("%lld%lld", &a, &b);

    int k = 0;
    for (int i = 0; i < BN; i++) {
      ll bi = 1LL << i;
      if (a % (bi << 1) != 0 && a + bi <= b)
	xs[k++] = bi, a += bi;
    }
    for (int i = BN - 1; i >= 0; i--) {
      ll bi = 1LL << i;
      if (a + bi <= b)
	xs[k++] = bi, a += bi;
    }

    printf("%d\n", k);
    for (int i = 0; i < k; i++) {
      printf("%lld", xs[i]);
      putchar(i + 1 < k ? ' ' : '\n');
    }
  }
  return 0;
}