output_description: Print all coordinates that potentially contain a stone painted black, in
  ascending order, with spaces in between.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      K X
attempt: K, X = input().split()
  K, X = int(K), int(X)
  print(" ".join([i for i in range(X - K + 1, X + K)]))
  
problem_description: 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.
samples: [{"input": "3 7", "output": "5 6 7 8 9\n    \n\nWe know that there are three stones painted black, and the stone at coordinate\n7 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,\nand 9.\n\n* * *"}, {"input": "4 0", "output": "-3 -2 -1 0 1 2 3\n    \n\nNegative coordinates can also contain a stone painted black.\n\n* * *"}, {"input": "1 100", "output": "100"}]