题目描述
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.
Examples
Input
3 7
Output
5 6 7 8 9
Input
4 0
Output
-3 -2 -1 0 1 2 3
Input
1 100
Output
100
输入格式
见题面
输出格式
见题面
样例输入
4 0
样例输出
-3 -2 -1 0 1 2 3