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 (Python):
K, X = map(int,input().split())

ans = []
for i in range(X-K+1, X+K):
    if abs(i) <= 1000000:
        ans.append(i)
print(" ".join(map(str,ans)))

Solution (Python):
K,X=list(map(int,input().split()))
m=max(-1000000,X-K+1)
M=min(1000000,X+K-1)
A=[]
for i in range(m,M+1):
    A.append(i)
print(' '.join(map(str,A)))

Solution (Python):
k,x= map(int,input().split())
start  = x - k + 1
end = x + k - 1
ans = []
for i in range(start,end+1,1):
  ans.append(str(i))
print(" ".join(ans))

Solution (Python):
import sys

m = 1000000

k, x = [ int(x) for x in sys.stdin.readline().split() ]

i = max(-m,x-k+1)
j = min( m,x+k-1)
for i in range(i,j+1):
    if i<j: print( i,end=" ")
    else: print(i)

Solution (Python):
K, X = map(int, input().strip().split())

start = max(-1000000, X - K + 1)
stop = min(1000000, X + K - 1) + 1

print(' '.join(map(str, range(start, stop))))

Solution (Python):
k, x = map(int,input().split())
l =[ (x-k+1+i) for i in range(2*k-1)]
print(" ".join(map(str,l)))

Solution (Python):

from collections import defaultdict, deque
import math
from math import factorial
import fractions
import re
import bisect

BIGNUM = 10 ** 9 + 7

def main():
    K, X = map(int, input().split())
    
    

    left = max([X-K+1, -2000000])
    right = min([X+K-1, 2000000])

    nums = list(range(left, right+1))

    print(" ".join(map(str, nums)))


if __name__ == '__main__':
    main()

Solution (Python):
import sys

k, x = map(int, input().split())

a = [str(i) for i in range(x-k+1, x+k)]

print(" ".join(a))

Solution (Python):
k, x = map(int, input().split())
ansstr = []
for i in range(x-k+1,x+k):
	ansstr.append(str(i))
print(" ".join(ansstr))

Solution (Python):
x,y = map(int,input().split())	

ansli=[]
for i in range (x * 2 - 1):
    ans = y - x + i + 1
    if (ans <= 1000000 and ans >= -1000000):
        ansli.append(ans)

for i in range(len(ansli)):
    print(ansli[i], end = "")
    if i != len(ansli) -1:
        print(" ", end="")
print("")

Solution (Python):
k, x = map(int, input().split())
y = k - 1
ans = [i for i in range(x - y,x + k)]
for i in ans:
    print(i, end=' ')
print()

Solution (Python):

import sys


def solve(K: int, X: int):
    ans = [i for i in range(max(-1000000, X-K+1),min(X+K, 1000000))]
    print(*ans)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  
    X = int(next(tokens))  
    solve(K, X)

if __name__ == '__main__':
    main()

Solution (Python):
k,x= map(int, input().split())
s=[]
for i in range(x-k+1,x+k):
  s.append(i)
print(*s)

Solution (Python):
k,x = map(int,input().split())
for i in range(2*k-1):
  a = x-k+1+i
  if -10**6 <= a <= 10**6:
    print(a,end=" ")

Solution (Python):


k, now = map(int,input().split())

start = now-k+1
end = now+k-1

for i in range(start,end+1):
    print(i,end="")
    if i != end:
        print(end=" ")

Solution (Python):
k, x = map(int, input().split())
ans = []
for i in range(x-k+1, x+k):
    ans.append(str(i))
print(" ".join(ans))

Solution (Python):
k,x=map(int,input().split())

nk=k-1
mn=x-nk
mx=x+nk+1
ls=[]
for i in range(mn,mx):
    ls.append(i)
    
def convert(list):
    res=" ".join(map(str, list))
    return res

print(convert(ls))

Solution (Python):
k, x = map(int, input().split())
lst = [str(i) for i in range(x - k + 1, x + k) if i >= -1000000 and i <= 1000000]
print(" ".join(lst))

Solution (Python):
k,x = map(int,input().split())

c = str(x-k+1)

for i in range(x-k+2,x+k) : 
    c += ' '+str(i)

print(c)

Solution (Python):
import math
import sys
import itertools
import queue
from fractions import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

mod = 1000000007

"""

a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654


char_list = list("abcd") 



    = sys.stdin.readline().rstrip()
    = list(sys.stdin.readline().rstrip())


    = int(sys.stdin.readline())
    = map(int, sys.stdin.readline().split())
    = list(map(int, sys.stdin.readline().split()))
    = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  
"""

if __name__ == "__main__":
    k,x =map(int, sys.stdin.readline().split())
    l=[]
    for i in range(x-k+1,x+k):
        l.append(i)
    print(*l)

Solution (Python):
k,x = map(int,input().split())
ls = []
for i in range(1,k):
    ls.append(x-i)
ls.append(x)
for i in range(1,k):
    ls.append(x+i)
ls = sorted(ls)
for i in ls:
    print(i,end=" ")

Solution (Python):
k, x = map(int, input().split(" "))
data = []
for i in range(x-k+1,x+k):
    data.append(i)
print(" ".join(map(str,data)))

Solution (Python):
k, x = list(map(int, input().split()))

for i in range(x-k+1, x+k):
  print(i)

Solution (Python):


K, X = list(map(int,input().split()))


T = [str(i) for i in range(X - (K-1), X + K) if i >= -1000000 and i <= 10000000]
print(' '.join(T))

Solution (Python):



def main():
    k, x = map(int, input().split())
    ans = list()

    for i in range(max(-10 ** 6, x - k + 1), min(10 ** 6 + 1, k + x)):
        ans.append(i)

    print(' '.join(map(str, ans)))


if __name__ == '__main__':
    main()

Solution (Python):
A = list(map(int,input().split()))
for _ in range(A[1] + 1 - A[0],A[1] + A[0]):
    if -1000000 <= _ and _ <= 1000000:
        print(_)

Solution (Python):
k,x = map(int,input().split())
l = [str(i) for i in range(x-k+1,k+x)]
print(' '.join(l))

Solution (Python):
lis=list(map(int,input().split()))

a=lis[1]-lis[0]+1
b=lis[0]*2-1
ans=[]

for i in range(b):
    ans.append(a+i)

print(*ans)

Solution (Python):
K, X = map(int, input().split())
p = range(max(X - K + 1, -1000000), min(X + K, 1000001))
print(" ".join(map(str, p)))

Solution (Python):
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

def main():
    K, X = MAP()
    minv = max(X - K + 1, -1000000)
    maxv = min(X + K - 1, 1000000)
    Y = list(range(minv, maxv+1))
    print(*Y)

if __name__ == '__main__':
    main()

Solution (Python):
nums = list(map(int, input().split()))
K, X = nums[0], nums[1]


for i in list(range(1, K))[::-1]:
    print(X-i, end='')
    print(' ', end='')

print(X, end=' ')
for i in range(1, K):
    print(X+i, end='')
    print(' ', end='')
print()

Solution (Python):
k,x = map(int, input().split())
lst=list(range(x-k+1,x+k))

for i in lst:
    print(i,end=" ")

Solution (Python):
K, X = map(int, input().split())
left = X - K + 1
right = X + K - 1
if left < -10**6:
    left = -10**6
if right > 10**6:
    right = 10**6

print(*list(range(left, right+1)))

Solution (Python):
K, X = map(int, input().split())

print(' '.join([str(a) for a in range(X-K+1, X+K)]))

Solution (Python):
a, b = map(int, input().split())
ans = []
for i in range(b-a+1, b+a):
    ans.append(str(i))
print(" ".join(ans))

Solution (Python):
from sys import stdin

def main():
    K, X = map(int, input().split())

    min_ = max(X - K + 1, -1000000)
    max_ = min(X + K -1, 1000000)
    ans = [i for i in range(min_, max_ + 1)]
    print(*ans)

input = lambda: stdin.readline()
main()

Solution (Python):

import sys

import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

k, x = readmi()

index = x - k + 1
s = defaultdict(int)
for i in range(k):
    for j in range(k):
        s[j + index] = 1
    index += 1
for i in sorted(s):
    print(i, end=" ")

Solution (Python):
K, X = map(int, input().split())
ansLst = []
ansLst.append(X)
for i in range(1, K):
    ansLst.append(X - i)
    ansLst.append(X + i)

ansLst.sort()

for i in ansLst:
    print(i, end=' ')

Solution (Python):
K,X=map(int, raw_input().split())

for i in range(X-K+1,X+K):
	print i,

Solution (Python):
k,x = list(map(int,input().split()))
for u in range(x-(k-1), x+k):
    print(u,end = " ")

Solution (Python):
k,x = list(map(int,input().split()))

for i in range(0,2*k-1):
    print(x-k+i+1,end = " ")

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]
K,X = map(int,input().split(' '))

st = X-(K-1)
if st<-10**6:
    st = -10**6
las = X+(K-1)
if las>10**6:
    las = 10**6

l = []
for i in range(st,las+1):
    l.append(str(i))

print(" ".join(l))

Solution (Python):
K, X = map(int, input().split())

min = X - K + 1
max = X + K - 1

for i in range(min, max + 1):
    print(i, end=" ")

Solution (Python):
k, x =  list(map(int, input().split() ))


a = range(x-k+1, x+k-1 + 1)
a = list(a)
a = map(str, a)
print(" ".join(a))

Solution (Python):

k,x = list(map(int,input().split()))
stones = 2000001
start = 1000000
end = 1000000
print(" ".join(list(map(str,[i for i in range(x-k+1,x+k)]))))

Solution (Python):
K,X=map(int,input().split())
m=max(X-K+1,-1000000)
M=min(X+K-1,1000000)
for i in range(m,M+1):
    print(i,end=" ")

Solution (Python):
k,x = map(int, input().split())
print(" ".join([str((x-k+1)+i) for i in range(2*k-1)]))

Solution (Python):
K,X = map(int,input().split())
ans = []
for i in range(max(X-(K-1),-1000000),min(X+(K-1)+1,1000000)):
    ans.append(str(i))
print(' '.join(ans))

Solution (Python):
k,x = map(int, input().split())
ans = [i for i in range(x-k+1,x+k)]
print(' '.join(map(str,ans)))

Solution (Python):
K,X=map(int,input().split())


start = X-K+1
end = X+K-1

for i in range(start,end+1):
    if i >= -1000000 and i <= 1000000:
       print(str(i)+' ',end='')
print()

Solution (Python):
k,x=map(int,input().split())

print(' '.join(map(str,sorted(set([i for i in range(x-k+1,x+k)])))))

Solution (Python):
k,x = map(int, input().split())
for i in range(x-k+1,x+k):
    print(i,end=' ')

Solution (Python):
K, X = map(int, input().split())


up = X + K - 1
lw = X - K + 1

lst = []
for i in range(lw, up+ 1):
    lst.append(i)


print(*lst)

Solution (Python):
k, x = (int(x) for x in input().split())
ans = []
for i in range(2*k-1):
  ans.append(x-k+1+i)
  
print(*ans)

Solution (Python):
K,X = map(int,input().split())
L = []
for n in range(X-K+1, X+K):
    L.append(n)
print(*L)

Solution (Python):
k, x = map(int, input().split())
print(*list(range(x - k + 1, x + k)))

Solution (Python):
K, X = map(int, input().split())
for i in range(X - K + 1, X + K):
    if i != X + K - 1:
        print(i, end=" ")
    else:
        print(i)

Solution (Python):
K, X = map(int, input().split(' '))

MIN = -1000000
MAX = 1000000

m = max(X - K + 1, MIN)
M = min(X + K - 1, MAX)

print(' '.join(map(str, list(range(m, M+1)))))

Solution (Python):
k, x = map(int, input().split())
ans = list(range(max(-1000000, x - (k - 1)), min(1000000, x + k)))
print(*ans)

Solution (Python):
k, x = (int(x) for x in input().split())
ans = [x for x in range(max(-1000000, x - k + 1), min(1000000, x + k))]
print(" ".join(map(str, ans)))

Solution (Python):
k,x=map(int,input().split())

print(" ".join(map(str,list(range(x-k+1,x+k)))))

Solution (Python):
k,x = list(map(lambda p: int(p), input().split()))
ans = ''
s = x - k + 1
for i in range(2*k - 1):
    ans += str(s+i) + ' '
    
print(ans)

Solution (Python):
import sys

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [K, X] = string_to_int(inputs[0])
    ret = []
    for i in range(X - K + 1, X + K):
        if i >= -1000000 and i <= 1000000:
            ret.append(i)
    return ret


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    s = ""
    for i in ret:
        s += "{} ".format(i)
    print(s.strip())

Solution (Python):
K, X = map(int, input().split())
ans = [str(i) for i in range(X-K+1, X+K)]
print(" ".join(ans))

Solution (Python):
a,b=map(int,input().split())
min=b-a+1
max=b+a-1
for i in range(min,max+1):
    print(i,end=" ")

Solution (Python):
k, x = map(int,input().split())

for i in range(x-(k-1),x+(k-1)+1):
    print(i, end='')
    if i != x+(k-1):
        print(' ',end='')

Solution (Python):
k,x = map(int,input().split())
for i in range(2*k-1):
        print(x-k+1+i, end=" ")

Solution (Python):
K, X = map(int, input().split())

K-=1
ans = ""
for num in range(X-K, X+K+1):
    ans += str(num) + " "
print(ans)

Solution (Python):
a,b=input().split()
a=int(a)
b=int(b)
for i in range((b-a)+1,(b+a)):
    print(i,end=" ")

Solution (Python):
K, X = map(int, input().split())

for i in range(X - K + 1, X + K):
    print(i, end = ' ')

Solution (Python):
K, X = map(int, input().split())
for i in range(X-K+1, X+K):
  print(i, end=" ")

Solution (Python):
parts = input().split(' ')
k = int(parts[0])
x = int(parts[1])

ans = []
for i in range(x - k + 1, x + k):
    if i >= -1000000 and i <= 1000000:
        ans.append(str(i))

print(' '.join(ans))

Solution (Python):
k,x=map(int, input().split())
al=[]
for n in range(x-(k-1), x+k):
    al.append(n)
print(*al)

Solution (Python):
k,x=[int(i) for i in input().split()]
for i in range(max(x-k+1,-1000000),min(1000000,x+k-1)+1):
    print(i,end=" ")

Solution (Python):
K, X = map(int, input().split())
for i in range(X-K+1, X+K):
    print(i, end="")
    if i == X+K-1:
        break
    print(" ", end="")
print()

Solution (Python):
def main():
    K,X = map(int,input().split())
    
    max = X + K - 1
    min = X - K + 1
    ans = []

    for i in range(min,max+ 1):
        ans.append(i)
        print(i, end=" ")




if __name__ == '__main__' :
    main()

Solution (Python):
k, x = map(int, input().split())
print(" ".join([str(i) for i in range(x-(k-1), x+(k))]))

Solution (Python):
K, X = map(int, input().split())
for i in range(X - K + 1, X + K):
    if i == X + K - 1:
        print(i)
    else:
        print(i, end=" ")

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    """ initialize variables and set inputs
    
        
        
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rmap = lambda: map(int, r().split())
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

    K, X = R()
    mink = X - (K-1)
    maxk = X + (K-1)
    mink = max(mink, -1000000)
    maxk = min(maxk, 1000000)
    print(*[i for i in range(mink, maxk+1)])
    
    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
k, x = list(map(int, input().split()))

ans = [str(i) for i in range(x-k+1, x+k)]

print(' '.join(ans))

Solution (Python):
k,x = map(int,input().split())

left = max([-1000000,(x - (k-1))])
right = min([1000000,(x + (k-1))])


for i in range(left,right+1):
    print(i, end = " ")

Solution (Python):


import math
import sys
import itertools
import numpy as np


k,x = map(int, input().split())


for i in range(x-k+1,x+k):
    if i >= -1000000 and i <= 1000000:
        print(i,end=" ")

print("")

Solution (Python):
k, x = list(map(int, input().split(' ')))
x -= k-1
a = []
for i in range(2*k-1):
    a.append(x)
    x += 1
print(' '.join(list(map(str, a))))

Solution (Python):
K,X=map(int, input().split())
for i in range(X-K+1,X+K):
  print(i,end=" ")

Solution (Python):
K, X = map(int, input().split())

min_x = X - (K - 1)
if min_x < -1000000:
    min_x = -1000000


max_x = X + (K - 1)

if max_x > 1000000:
    max_x = 1000000

ans = ""
for i in range(min_x, max_x + 1):
    ans += str(i) + " "

print(ans[:-1])

Solution (Python):
k, x = map(int, input().split())
ans = [str(i+x-(k-1)) for i in list(range(2*k-1))]
print(' '.join(ans))

Solution (Python):
def calc(K, X):
    return ' '.join([str(x) for x in range(X - K + 1, X + K)])


(K, X) = tuple([int(s) for s in input().split(' ')])
print(calc(K, X))

Solution (Python):
import sys

input = sys.stdin.readline

K, X = map(int, input().strip().split(' '))
for i in range(- K + 1, K):
    print(X + i)

Solution (Python):
def solve():
    k, x = list(map(int, input().split()))
    ans = []
    for i in range(x - k + 1, x + k):
        ans.append(i)
    return " ".join([str(i) for i in ans])


if __name__ == "__main__":
    print(solve())

Solution (Python):
a,b = map(int,input().split())
listn = [i for i in range(b-a+1,b+a)]
print(*listn)

Solution (Python):


k, x = input().split()
k = int(k)
x = int(x)

for i in range(x-k+1, x+k):
    print(i, end=" ")
print()

Solution (Python):
k, x, = map(int, input().split())
l = max(-1000000, x - k + 1)
r = min(1000000, x + k - 1)
ans = list(range(l, r + 1))
print(*ans)

Solution (Python):
k, x = list(map(int, input().split()))

a = [i for i in range(x-k+1, x+k)]
ans = ' '.join(list(map(str, a)))
print(ans)

Solution (Python):
k,x = map(int,input().split())

sita = x - k
ue = x + k
ans = ''

if sita == ue:
    print(sita)
else:
    for i in range(sita+1,ue):
        ans += str(i) + ' '
    print(ans)

Solution (Python):
K, X = list(map(int, input().split()))

print(*[i for i in range(X - K + 1, X + K)])

Solution (Python):
k, x = [int(i) for i in input().split()]
print(" ".join([str(i) for i in range(max(-1000000, x - k + 1), min(1000001, x + k))]))

Solution (Python):
k, x = map(int,input().split())

for i in range(x-k+1,x+k):
    print(i,end="")
    print(" ",end="")
print("")

Solution (Python):
k,x=list(map(int,input().split()))
start=max(-1*10**6,x-(k-1))
end=min(10**6,x+(k-1))
for i in range(start,end+1):
	print(i,end=" ")
print()

Solution (Python):
K, X = map(int, input().split())

_max = 1000000
_min = -1000000


ans_l = []

for i in range(K-1, 0, -1):
    if X-i <= _max and X-i >= _min:
        ans_l.append(X-i)


for i in range(K):
    if X+i <= _max and X+i >= _min:
        ans_l.append(X+i)

print(*ans_l)

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline().strip()
INF = 10 ** 18
MOD = 10 ** 9 + 7

def main(): 
    K, X = LI()
    start = X-K+1
    end = X+K-1
    li = [str(x) for x in list(range(start, end+1)) if -1000000 <= x <= 1000000]
    print(' '.join(li))

main()

Solution (Python):
K,X = map(int,input().split())

m,M = -1000000,1000000
if X - (K - 1) > m: m = X - (K - 1)
if X + (K - 1) < M: M = X + (K - 1)

ans = [i for i in range(m,M+1)]
print(' '.join(map(str,ans)))

Solution (Python):
K, X = map(int, input().split())
ans = [i for i in range(X-K+1, X+K) if (i>-1000000 and i<1000000)]
print(*ans)

Solution (Python):

import sys, math, fractions, itertools


def solve(K: int, X: int):
    A = []
    for i in range(2*K-1):
        A.append(str(X-K+i+1))
    print(' '.join(A))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  
    X = int(next(tokens))  
    solve(K, X)

if __name__ == '__main__':
    main()

Solution (Python):
k, x = map(int, input().split())

print(*range(x - (k - 1), x + (k - 1) + 1))

Solution (Python):
K, X = map(int, input().split())

ans = []
sta = X-(K-1)
end = X+(K-1)

for i in range(sta,end+1):
  ans.append(i)
  
print(*ans)

Solution (Python):
k, x = map(int, input().split())

ans = []
for i in range(x-k+1, x+k):
    ans.append(str(i))

print(" ".join(ans))

Solution (Python):
[k,x] = [int(i) for i in input().split()]
ls =[]
if x - k + 1 < -100000:
    for i in range(-100000,x+k):
        ls.append(i)
elif x + k - 1 > 100000:
    for i in range(x - k + 1, 100001):
        ls.append(i)
else:
    for i in range(x - k + 1,x + k):
        ls.append(i)
ans = ""
for i in range(len(ls)):
    ans += str(ls[i]) + " "
print(ans[:-1])

Solution (Python):
K,X = [int(i) for i in input().split()]
print(' '.join(map(str, list(range(X-K+1,X+K,1)))))

Solution (Python):
K,X = map(int,input().split())
R = 1000000 - X
L = X + 1000000
if R <= K:
    for i in range(X-K+1,1000001):
        print(i,end = " ")
elif L <= K:
    for i in range(-1000000,X+K):
        print(i,end = " ")
else:
    for i in range(X-K+1,X+K):
        print(i,end = " ")

Solution (Python):

import sys

def main():
    K,X = [int(i) for i in sys.stdin.readline().strip().split()]
    MIN = -1000000
    MAX = 1000000
    start = max(X - (K -1), MIN)
    end = min(MAX, X + (K - 1))
    print(" ".join([str(i) for i in range(start, end+1)]))
        


def solve():
    pass


if __name__ == "__main__":
    main()

Solution (Python):
k, x = map(int, input().split())

ans = []


for i in range(x - (k - 1), x + (k - 1) + 1):
    ans.append(i)


print(' '.join([str(i) for i in ans]))

Solution (Python):
K,X = map(int,input().split())
li = []
for i in range(X-K+1,X,1):
    li += [str(i)]
for j in range(X,X+K,1):
    li += [str(j)]
print(' '.join(li))

Solution (Python):
K, X = map(int, input().split())
A = [i for i in range(X-K+1, X+K)]
ans =[]
for a in A:
  if a<-1000000 or 1000000<a:
    continue
  ans += [str(a)]
print(' '.join(ans))

Solution (Python):
k, x = map(int, input().split())

print(' '.join(map(str, range(x-(k-1),x+k))))

Solution (Python):
k, x = map(int, input().split())
l = [i for i in range(x-k+1, x+k)]
print(' '.join(map(str, l)))

Solution (Python):

k, x = map(int, input().split())
s = max(-1000000, x - k + 1)
e = min(1000000, x + k)
print(" ".join([str(i) for i in range(s, e)]))

Solution (Python):
k, x = map(int, input().split())

num = k - 1
ans = []
for i in range(x-num, x+num+1):
    ans.append(i)

print(' '.join(map(str, ans)))