import java.util.LinkedList;
import java.util.Scanner;

public class Main {
	public static void main(String[] args){

		Scanner sc = new Scanner(System.in);
		int K = sc.nextInt();
		int X = sc.nextInt();
		
		int min = X - K + 1;
		int max = X + K -1;
		LinkedList<Integer> ansList = new LinkedList<Integer>();
		
		for(int i = min; i <= X; i++) {
			ansList.add(i);
		}
		
		for(int i = X + 1; i <= max; i++) {
			ansList.add(i);
		}
		
		for(int i = 0; i < ansList.size() ; i++ ) {
			if ( i > 0 ) {
				System.out.print(" ");
			}
			System.out.print(ansList.get(i));
		}

		sc.close();
	}
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz