#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
//const ll INF = 1LL << 60;
//const int INF = 1001001001;

int main(void){
    int k,x;
    cin >> k >> x;
    for(int i=x-(k-1);i<=x+(k-1);i++)
        printf("%d ",i);

    return 0;
}
#include <iostream>
using namespace std;

int main() {
    int n;
    cin >> n;

    int *ary = new int[n];
    for (int i = 0; i < n; ++i) {
        cin >> ary[i];
    }

    int _n = n - 1;
    for (int j = _n; 0 <= j; --j) {
        if (j == 0)
            cout << ary[j] << endl;
        else
            cout << ary[j] << " ";
    }

    delete[] ary;
    return 0;
}