{"raw_statement":[{"iden":"problem statement","content":"There are $2000001$ stones placed on a number line. The coordinates of these stones are $-1000000, -999999, -999998, \\ldots, 999999, 1000000$.\nAmong them, some $K$ consecutive stones are painted black, and the others are painted white.\nAdditionally, we know that the stone at coordinate $X$ is painted black.\nPrint all coordinates that potentially contain a stone painted black, in ascending order."},{"iden":"constraints","content":"*   $1 \\leq K \\leq 100$\n*   $0 \\leq X \\leq 100$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$K$ $X$"},{"iden":"sample input 1","content":"3 7"},{"iden":"sample output 1","content":"5 6 7 8 9\n\nWe know that there are three stones painted black, and the stone at coordinate $7$ is painted black. There are three possible cases:\n\n*   The three stones painted black are placed at coordinates $5$, $6$, and $7$.\n*   The three stones painted black are placed at coordinates $6$, $7$, and $8$.\n*   The three stones painted black are placed at coordinates $7$, $8$, and $9$.\n\nThus, five coordinates potentially contain a stone painted black: $5$, $6$, $7$, $8$, and $9$."},{"iden":"sample input 2","content":"4 0"},{"iden":"sample output 2","content":"\\-3 -2 -1 0 1 2 3\n\nNegative coordinates can also contain a stone painted black."},{"iden":"sample input 3","content":"1 100"},{"iden":"sample output 3","content":"100"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}