#include using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rrep(i, n) for(int i = n-1; i >= 0; i--) #define all(x) (x).begin(),(x).end() // 昇順ソート #define rall(v) (v).rbegin(), (v).rend() // 降順ソート #define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0) #define sz(x) ((int)(x).size()) typedef long long ll; using P = pair; using VI = vector; using VVI = vector>; using VL = vector; using VVL = vector>; using VP = vector

; template void view(T e){std::cout << e << std::endl;} template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; } const int inf = 1 << 30; const ll INF = 1LL << 60; int main(){ int t; cin >> t; // random_device seed_gen; // mt19937_64 engine(seed_gen()); while(t--){ ll a, b; cin >> a >> b; // a = engine() % (ll) 1e18+1; // b = engine() % (ll) 1e18+1; // if (a > b) continue; VL ans; while(2*a <= b){ ans.push_back(a); a *= 2; } while(a != b){ if (a % 2 != 0){ a++; ans.push_back(1); } ll num = 1, p = 1; ll diff = b - a; while(num <= diff){ if (a % num == 0){ p = num; } num *= 2; } a += p; ans.push_back(p); } view(sz(ans)); rep(i,sz(ans)) printf("%lld%c", ans[i], i==sz(ans)-1?'\n':' '); } return 0; }