#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

void solve(){
  ll A,B;
  cin>>A>>B;

  vector<ll> ans;
  for(int t=0;t<120;t++){
    if(A==B) break;
    ll num=0;
    ll val=A;
    while(val%2==0){
      val/=2;
      num++;
    }

    ll res=0;
    for(ll j=num;j>=0;j--){
      if(A+(1ll<<j)<=B){
        res=(1ll<<j);
        break;
      }
    }

    ans.push_back(res);
    A+=res;
  }

  cout<<ans.size()<<"\n";
  for(auto n:ans) cout<<n<<" ";
  cout<<"\n";
}

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

  int T;
  cin>>T;
  rep(i,T) solve();

  return 0;
}