// #include<iostream>
// #include<climits>
// #include<numeric>
// #include<algorithm>
// #include <sstream>
// #include<cstring>
// #include<cmath>
// #include<iterator>
// #include<utility>
// #include<array>
// #include<vector>
// #include<deque>
// #include<queue>
// #include<stack>
// #include<list>
// #include<forward_list>
// #include<set>
// #include<unordered_set>
// #include<map>
// #include<unordered_map>
// #define ll long long
// #define ull unsigned long long
// #define vi vector<int>
// #define vlli vector<long long int>
// #define vvi vector<vector<int>>
// #define vpii vector<pair<int,int>>
// #define vs vector<string>
// #define pa(a) cout<<a<<endl;
// #define lin1(x) ll int x; x = scan();
// #define lin2(x,y) ll int x, y; x = scan(), y = scan();
// #define lin3(x,y,z) ll int x, y, z; x = scan(), y = scan(), z = scan();
// #define pb(x) push_back(x)
// #define makep(x,y) make_pair(x,y)
// #define mx(a,b) (a)>(b)?(a):(b)
// #define mn(a,b) (a)<(b)?(a):(b)
// #define fori(s,e) for(i=s;i<=e;i++)
// #define forj(s,e) for(j=s;j<=e;j++)
// #define fork(s,e) for(k=s;k<=e;k++)
// #define rep(i,s,e) for(int i=s;i<=e;i++)
// #define brep(i,s,e) for(int i=s;i>=e;i--)
// #define all(x) x.begin(),x.end()
// #define mem(x,y) memset(x,y,sizeof(x));
// #define bits1(x) __builtin_popcount(x)
// #define pi 3.14159265358979323846264338327950
// #define MOD7 1000000007
// #define MOD9 1000000009
// #define fast std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
// using namespace std;

// int main()
// {
// #ifdef RAHUL
//     freopen("input.txt","r",stdin);
// #endif
// string s;
// cin>>s;
// int shifts=17;
// for (int i = 0; i < s.length(); ++i)
// {
//     /* code */
//     int rahul=(s[i]-'a'+shifts)%26+97;
//     char rohan=rahul;
//     cout<<rohan<<endl; 
// }





// return 0;
// }

#include<iostream>
#include<climits>
#include<numeric>
#include<algorithm>
#include <sstream>
#include<cstring>
#include<cmath>
#include<iterator>
#include<utility>
#include<array>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<forward_list>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define vpii vector<pair<int,int>>
#define vs vector<string>
#define pa(a) cout<<a<<endl;
#define lin1(x) ll int x; x = scan();
#define lin2(x,y) ll int x, y; x = scan(), y = scan();
#define lin3(x,y,z) ll int x, y, z; x = scan(), y = scan(), z = scan();
#define pb(x) push_back(x)
#define makep(x,y) make_pair(x,y)
#define mx(a,b) (a)>(b)?(a):(b)
#define mn(a,b) (a)<(b)?(a):(b)
#define fori(s,e) for(i=s;i<=e;i++)
#define forj(s,e) for(j=s;j<=e;j++)
#define fork(s,e) for(k=s;k<=e;k++)
#define rep(i,s,e) for(int i=s;i<=e;i++)
#define brep(i,s,e) for(int i=s;i>=e;i--)
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x));
#define bits1(x) __builtin_popcount(x)
#define pi 3.14159265358979323846264338327950
#define MOD7 1000000007
#define MOD9 1000000009
#define fast std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
// class Solution {
// private:
//     unordered_map<char,string>phonebook={{'2',"abc"},{'3',"def"},{'4', "ghi"},
//                                              {'5', "jkl"}, {'6', "mno"}, {'7', "pqrs"}, {'8', "tuv"},
//                                              {'9', "wxyz"}};


int main()
{
#ifdef RAHUL
    freopen("input.txt","r",stdin);
#endif
ll k,x;
cin>>k;
cin>>x;

for (int i = x-k+1; i <=k+x-1; ++i)
{
    if(i>=-10000000000 &&i<=100000000){
        cout<<i<<" ";
    }
    /* code */
}


    return 0;   
}


Measured memory_bytes: 256