题目

思路：

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
const int maxn = 1e6 + 5, inf = 1e18, maxm = 4e4 + 5;
const int N = 1e6;
const int mod = 1e9 + 7;
// const int mod = 998244353;
//const __int128 mod = 212370440130137957LL;
//  int a[1005][1005];
// bool vis[505][505];
int n, m;
int a[maxn];
int b[maxn];
string s;// struct Node{
//     int a, b;
//     // int val, id;
//     bool operator<(const Node &u)const{//     }
// }node[maxn];//long long ? maxn ? n? m?
void solve(){int res = 0;int k;cin >> n >> k;// for(int i = 1; i <= n; i++){//     cin >> a[i];// }int t = __lg(k);vector<int> ans;for(int i = 0; i <= t - 1; i++){ans.pb(1LL << i);}ans.pb(k - (1LL << t));ans.pb(k + 1);ans.pb(k + 1 + (1LL << t));for(int i = t + 1; i <= 19; i++){ans.pb(1LL << i);}cout << ans.size() << '\n';for(auto x : ans){cout << x << ' ';}cout << '\n';
}   signed main(){ios::sync_with_stdio(0);cin.tie(0);int T = 1;cin >> T;while (T--){solve();}return 0;
}