#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define endl codeforces #define ALL(v) std::begin(v), std::end(v) #define ALLR(v) std::rbegin(v), std::rend(v) using ll = std::int64_t; using ull = std::uint64_t; using pii = std::pair; using tii = std::tuple; using pll = std::pair; using tll = std::tuple; using size_type = ssize_t; template using vec = std::vector; template using vvec = vec>; template const T& var_min(const T &t) { return t; } template const T& var_max(const T &t) { return t; } template const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); } template const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); } template void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); } template void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); } template struct multi_dim_array { using type = std::array::type, Head>; }; template struct multi_dim_array { using type = std::array; }; template using mdarray = typename multi_dim_array::type; template void fill_seq(T &t, F f, Args... args) { if constexpr (std::is_invocable::value) { t = f(args...); } else { for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); } } template vec make_v(size_type sz) { return vec(sz); } template auto make_v(size_type hs, Tail&&... ts) { auto v = std::move(make_v(std::forward(ts)...)); return vec(hs, v); } namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; } template T ceil_pow2(T bound) { T ret = 1; while (ret < bound) ret *= 2; return ret; } template T ceil_div(T a, T b) { return a / b + !!(a % b); } ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } void solve() { ll a, b; std::cin >> a >> b; ll g = gcd(a, b); a /= g; b /= g; vec ans; auto output = [&](ll c) { ans.push_back(c * g); }; while (b % 2 == 0) { output(a); b /= 2; g *= 2; } for (ll d = 0;; d++) { ll mask = (1ll << d); if (b < a + mask) break; if (!(a & mask)) continue; output(mask); a += mask; } for (ll i = 30; 0 <= i; i--) { ll bmul = (1ll << i); if (bmul + a <= b) { output(bmul); a += bmul; } } assert(ans.size() <= 120); std::cout << ans.size() << "\n"; for (ll i = 0; i < ans.size(); i++) std::cout << ans[i] << " \n"[i + 1 == ans.size()]; } int main() { ll t; std::cin >> t; while (t--) solve(); return 0; }