#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);



int main(){
  int k, x;
  cin >> k >> x;

  int l = max(-1000000, x-(k-1));
  int r = min(100000, x+(k-1));

  for(int i = l; i <= r ; ++i){
    cout << i << " ";
  }
  cout << endl;
  return 0;
}
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }

int main(){
    int K, X;
    cin >> K >> X;
    for(int i=X-K+1; i<K+X; ++i){
        if(i==K+X-1){
            cout << i;
        }
        else cout << i << " ";
    }
    return 0;

}
