Problem:
Score : 200 points

Problem Statement

There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000.

Among them, some K consecutive stones are painted black, and the others are painted white.

Additionally, we know that the stone at coordinate X is painted black.

Print all coordinates that potentially contain a stone painted black, in ascending order.

Constraints

1 \leq K \leq 100

0 \leq X \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

K X

Output

Print all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.

Sample Input 1

3 7

Sample Output 1

5 6 7 8 9

We know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:

The three stones painted black are placed at coordinates 5, 6, and 7.

The three stones painted black are placed at coordinates 6, 7, and 8.

The three stones painted black are placed at coordinates 7, 8, and 9.

Thus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.

Sample Input 2

4 0

Sample Output 2

-3 -2 -1 0 1 2 3

Negative coordinates can also contain a stone painted black.

Sample Input 3

1 100

Sample Output 3

100

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;
public class Main {
    public static void main (String[]args){
        //数直線上に 2000001個の石が置かれています。これらの石の座標は −1000000,−999999,−999998,…,999999,1000000です。
        //これらの石のうち、ある連続する K個の石が黒で塗られており、それ以外の石は白で塗られています。
        //また、座標 Xにある石は黒で塗られていることが分かっています。黒で塗られている石が置かれている可能性のある座標をすべて、小さい順に出力してください。

        // 制約 1≤K≤100 0≤X≤100 入力中の値はすべて整数である。

        // Scannerのインスタンス化
        Scanner scanner = new Scanner(System.in);
        
        int K = scanner.nextInt();
        int X = scanner.nextInt();

        // 黒塗りされた石の最大値
        int max  = K + (X - 1);

        // 黒塗りされた石の最小値
        int min = K - (X - 1);

        // 全出力を行う
        while (min <= max){
            System.out.print(min);
            min++;
        }
                
        scanner.close();

    }
}