import java.util.Scanner;

/**
 * B - One Clue
 */
public class Main {

    public static void main(String[] args) {

        Scanner sc = new Scanner( System.in );
        int k = sc.nextInt();   // 黒石の数
        int x = sc.nextInt();   // 必ず黒石である座標

        int before = x - ( k - 1 );
        int after = x + ( k - 1 );

        for( int i = before; i <= after; i++ ) {
            if( i > before ) System.out.print( " " );
            System.out.print( i );
        }
        System.out.println();

        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