func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long int mod = 1e9 + 7;   void solve() {     long long int n, k;     cin >> n >> k;     if (n / 2 > k or n == 1) {       if (k == 0 and n == 1) {         cout << 1 <<   n ;         return;       }       cout << -1 <<   n ;       return;     } else {       vector<long long int> v;       k -= (n / 2);       k++;       if (k == 0) k = 1;       v.push_back(k);       v.push_back(2 * k);       map<long long int, long long int> make_pair;       make_pair[k]++;       make_pair[2 * k]++;       long long int c = 1;       for (__typeof(n / 2 - 1) i = (0) - ((0) > (n / 2 - 1));            i != (n / 2 - 1) - ((0) > (n / 2 - 1));            i += 1 - 2 * ((0) > (n / 2 - 1))) {         while (make_pair[c] + make_pair[c + 1] != 0) {           c++;         }         v.push_back(c);         v.push_back(c + 1);         make_pair[c]++;         make_pair[c + 1]++;         c += 2;       }       if (v.size() != n) {         while (make_pair[2 * k + 1] != 0) k++;         v.push_back(2 * k + 1);       }       for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));            i += 1 - 2 * ((0) > (n))) {         cout << v[i] <<    ;       }     }   }   int32_t main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     long long int t;     t = 1;     while (t--) {       solve();     }     return 0;   }   