/* 
 * Project: AtCoder Beginners Contest 137 B - One Clue
 * Author: toms74209200 <https://github.com/toms74209200>
 *
 * Created on 2020/09/01
 * Copyright (c) 2020 toms74209200
 * 
 * This software is released under the MIT License.
 * http://opensource.org/licenses/mit-license.php
 */
#include <cstdio>
#include <cstdint>
using namespace std;

int32_t k;
int32_t coord_x;

void solve() {

    for (int i=-k+1;i<k;i++) {
        printf("%d ", coord_x+i);
    }

    printf("\n");

}

int main() {

    scanf("%d", &k);
    scanf("%d", &coord_x);

    solve();

}

#include <iostream>      // cout, endl, cin
#include <string>        // string, to_string, stoi
#include <vector>        // vector
#include <algorithm>     // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility>       // pair, make_pair
#include <tuple>         // tuple, make_tuple
#include <cstdint>       // int64_t, int*_t
#include <cstdio>        // printf
#include <map>           // map
#include <queue>         // queue, priority_queue
#include <set>           // set
#include <stack>         // stack
#include <deque>         // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset>        // bitset
#include <cctype>        // isupper, islower, isdigit, toupper, tolower
#include <iomanip>       // fixed, setprecision
using namespace std;

int main()
{
  int K, X, start = 0, end = 0;
  cin >> K >> X;
  start = X - K + 1;
  end = X + K - 1;
  for (int i = start; i <= end; i++)
  {
    cout << i << " ";
  }
  cout << endl;
}
