// #pragma GCC optimize("Ofast") // #pragma GCC target("avx2,bmi,bmi2,lzcnt") // #define NDEBUG #include #include struct rep { struct iter { int i; constexpr void operator++() { ++i; } constexpr int operator*() const { return i; } friend constexpr bool operator!=(iter a, iter b) { return *a != *b; } }; const int l, r; constexpr rep(int _l, int _r) : l(std::min(_l, _r)), r(_r) {} constexpr rep(int n) : rep(0, n) {} constexpr iter begin() const { return {l}; } constexpr iter end() const { return {r}; } }; struct per { struct iter { int i; constexpr void operator++() { --i; } constexpr int operator*() const { return i; } friend constexpr bool operator!=(iter a, iter b) { return *a != *b; } }; const int l, r; constexpr per(int _l, int _r) : l(std::min(_l, _r)), r(_r) {} constexpr per(int n) : per(0, n) {} constexpr iter begin() const { return {r - 1}; } constexpr iter end() const { return {l - 1}; } }; template constexpr bool chmin(T& a, U&& b) { return b < a ? a = std::forward(b), true : false; } template constexpr bool chmax(T& a, U&& b) { return a < b ? a = std::forward(b), true : false; } int main() { using namespace std; cin.tie(nullptr)->sync_with_stdio(false); int tt; cin >> tt; while (tt--) { int64_t a, b; cin >> a >> b; int d = __lg(a ^ b); if ((a & (a - 1)) == 0 and __lg(a) == __lg(b)) d = __lg(a); vector ans; for (int s : rep(d)) if (a >> s & 1) { ans.push_back(int64_t(1) << s); a += ans.back(); } for (int s : per(d)) if (b >> s & 1) ans.push_back(int64_t(1) << s); cout << size(ans) << '\n'; for (int i : rep(size(ans))) cout << ans[i] << " \n"[i == int(size(ans)) - 1]; } }