import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		sc.close();
		List<Integer> ans = new ArrayList<Integer>();
		switch (a) {
		case 1:
			ans.add(b);
			break;
		default:
			for (int i = 0; i < 2; i++) {
				int max = b + a - 1;
				int min = b - a + 1;
				for (int l = b; l <= max; l++) {
					if (!ans.contains(l)) {
						ans.add(l);
					}
				}
				for (int l = b; l >= min; l--) {
					if (!ans.contains(l)) {
						ans.add(l);
					}
				}
			}
		}
		Collections.sort(ans);
		for (int i : ans) {
			System.out.print(i + " ");
		}
		System.out.println();
	}

}

/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