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



Sample input:
3 7


Sample output:
5 6 7 8 9

Submission status: Accepted

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

num = [i for i in range(X-K+1, X)] + [X] + [i for i in range(X+1, X+K)]

print(' '.join(str(i) for i in num))

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**9)
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

k,x = na()
a = []

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

print(' '.join([str(s) for s in a]))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
k, x = map(int, input().split())
ans = []
for i in range(x-k+1, x+k):
    ans.append(i)
print(*ans)

Submission status: Accepted

Solution code:
k, x = (int(x) for x in input().split())

ans = [x]

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

ans.sort()

for n in range(len(ans)):
  print(ans[n], end=" ")

Submission status: Accepted

Solution code:
import numpy as np
n1, n2=input().split(' ')
n1 = int(n1)
n2 = int(n2)
n1_1 =  n1 - 1
result = ''
for  i in range(n2 - n1_1, n2 + n1_1 + 1 ,1):
    result += str(i) + ' '
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

import sys

X_min = X - (K-1)
X_max = X + (K-1)

if (X_max > 1000000):
    X_max = 1000000
if (X_min < -1000000):
    X_min = -1000000

for i in range(X_max - X_min + 1):
    sys.stdout.write(str(X_min) + " ")
    # print(str(X_min)),
    X_min += 1

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K, X = list(map(int, input().split()))
_min = X-K+1
_max = X+K-1
print('{}'.format(' '.join(list(map(str, list(range(_min, _max+1)))))))

Submission status: Accepted

Solution code:
K, X = map(int, input().split())
suuti = []
for i in range(2*K-1):
    suuti.append(X-K+1+i)
suutiSTR = map(str, suuti)
print(" ".join(suutiSTR))

Submission status: Accepted

Solution code:
List = list(map(int,input().split()))

K = List[0]
X = List[1]
pp = []

for i in range(X-K+1,X+K):
    pp.append(int(i))

print(*pp)

Submission status: Accepted

Solution code:
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=" ")

Submission status: Accepted

Solution code:
lis = input().split(" ")

K = int(lis[0])
X = int(lis[1])

mini = X - (K - 1)
maxm = X + (K - 1)
list_a = []
for i in range(0, (K - 1) * 2 + 1):
    list_a.append(str((X - (K - 1)) + i))

print(" ".join(list_a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int, input().split())

c=list(range(b-a+1,b+a))

d = [str(i) for i in c]

print(" ".join(d))

Submission status: Accepted

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

a = (X-K)+1
b = (X+K)-1


p = [str(i) for i in range(a,b+1)]
q = " ".join(p)
print(q)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

l = list(range(x-k+1,x+k))

for i in l:
    print(str(i) + " ", end="")

Submission status: Accepted

Solution code:
k,x=map(int,input().split())
hidari=x-k+1
list1=[]

for i in range(2*k-1):
    list1.append(hidari)
    hidari=hidari+1
    
print(' '.join(map(str, list1)))

Submission status: Accepted

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


min_x = x - (k-1)
max_x = x + (k-1)
ans = []
for i in range(min_x, max_x+1):
  ans.append(i)
  if(i == max_x):
  	print(i)
  else:
    print(i,end=" ")

Submission status: Accepted

Solution code:
a = list(map(int, input().split(" ")))
K=a[0]
X=a[1]

tmp=K
while tmp>1:
	print(X-tmp+1, end=" ")
	tmp -= 1
print(X, end=" ")
tmp=1
while tmp<K:
	print(X+tmp, end=" ")
	tmp += 1

Submission status: Accepted

Solution code:
# coding: utf-8


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

    mx = x + k - 1
    mi = x - k + 1

    l = [str(i) for i in range(mi, mx + 1)]
    print(" ".join(l))

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K, X = [int(x) for x in input().split()]

ls = [str(i) for i in range(X-K+1, K+X)]

print(" ".join(ls))

Submission status: Accepted

Solution code:
K,X=map(int,input().split())
print(*[i for i in range(X-K+1, X+K)])

Submission status: Accepted

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

z = str(x-k+1)

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

print(z)

Submission status: Accepted

Solution code:
k,x = map(int,input().split())
A =[]
for i in range(x-k+1,x+k):
    A.append(i)
A.sort()
a = ''
for j in A:
    a += str(j)+' '
print(a)

Submission status: Accepted

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

p = []
l = []
for  i in range(k):
	l.append(x-i)


for i in range(k):
	for j in range(k):
		p.append(l[j]+i)
q = list(set(p))
q.sort()
print(*q)

Submission status: Accepted

Solution code:
#coding : utf-8

import os
import sys

K, X = map(lambda x: int(x), input().split(" "))

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

Submission status: Accepted

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

ans = []
for i in range(X-K+1, X):
	ans.append(i)
for i in range(X, X+K):
  	ans.append(i)
sorted(ans)
for e in ans:
  print(e, " ", end="")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
lst = []
for i in range(b -a + 1, b + a):
    lst.append(str(i))

print(" ".join(lst))

Submission status: Accepted

Solution code:
import numpy as np
def acinput():
    return list(map(int,input().split(" ")))

K,X=acinput()

print(" ".join(map(lambda x:str(x),np.arange(X-K+1,X+K))))

Submission status: Accepted

Solution code:
k,x=map(int,input().split())
a=[]
for i in range(k-1):
    a.append(x-i-1)
for i in range(k):
    a.append(i+x)
ass=sorted(a)
print(*ass,sep=" ")

Submission status: Accepted

Solution code:
param = list(map(int, input().split()))
k = param[0]
x = param[1]
start = x - (k - 1)
end = x + k
for i in range(start, end):
    print(i, end=" ")

Submission status: Accepted

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

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

Submission status: Accepted

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

a = x-k+1
z = x+k-1

list = []
for i in range(a, z+1):
    list.append(str(i))

ans = ' '.join(list)
print(ans)

Submission status: Accepted

Solution code:
a ,b = map(int,input().split())

for i in range((a*-1)+1,a):
    print(i+b,end="")
    if i != (a-1):
        print(" ",end="")

Submission status: Accepted

Solution code:
input = input().split()

k = int(input[0])
x = int(input[1])

min = x - (k - 1)
max = x + (k - 1)

if min < -100000: min = -1000000

if max > 1000000: max = 1000000

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

Submission status: Accepted

Solution code:
import sys

n = list(map(int, input().split()))
k = n[0]
x = n[1]

start = min([(x - k + 1), -100])

if k is 1:
  print(x)
  quit()


i = 0
while True:
  if x - k + 1 + i == x:
    break
  print(x - k + 1 + i, end = " ")
  i += 1

j = 0
while True:
  print(x+j, end = " ")
  j += 1
  if x+j == x + k - 1:
    print(x + k - 1)
    quit()

Submission status: Accepted

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

Submission status: Accepted

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

stone = [str(i) for i in range(-1000000, 1000001, 1)]
idx = stone.index(str(x))

print(" ".join(stone[idx - k + 1: idx + k]))

Submission status: Accepted

Solution code:
b,x = map(int,input().split())
bList = []
for i in range((b * 2) - 1):
    if i == ((b * 2) - 1) - 1:
        print((x - b) + 1 + i)
    else:
        print((x - b) + 1 + i, end=" ")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = [int(x) for x in input().split()]
tl = list(range(-a+b+1,a+b))
for i in tl:
  print(i,end=' ')

Submission status: Accepted

Solution code:
k, x = [int(i) for i in input().split()]
minimum = 1000000 - k + 1 if x + k - 1 > 1000000 else max(x - k + 1, -1000000)
maximum = -1000000 + k - 1 if x - k - 1 < -1000000 else min(x + k - 1, 1000000)
print(*range(minimum, maximum + 1))

Submission status: Accepted

Solution code:
a,b=(int(x) for x in input().split())

l=list(range(a))

for i in reversed(l):
    print(b-i,end=' ')

l.pop(0)

for i in l:
    print(b+i,end=' ')

print()

Submission status: Accepted

Solution code:
k,x=map(int,input().split())
if k == 1:
    print(x)
else:
    ans = list(range(x-k+1, x+k))
    for i in ans:
        print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
p, q  = map(int, input().split())
l = []

for i in range(2*p-1):
  print(q-p+1+i,end=" ")

Submission status: Accepted

Solution code:
k,x = map(int,input().split())
num = []
for i in range(x-k+1,x+k):
    num.append(i)

L=[str(a) for a in num]
L=" ".join(L)
print(L)

Submission status: Accepted

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

left = X-(K-1)
right = X+(K-1)
ans = list(map(str,range(left,right+1)))
print(' '.join(ans))

Submission status: Accepted

Solution code:
K, X = [int(a) for a in input().split()]
print(" ".join([str(i) for i in range(max(X-K+1, -10000), min(X+K-1, 10000)+1)]))

Submission status: Accepted

Solution code:
k, x = map(int, input().split())
bm = max(x-k+1, -1000000)
bM = min(x+k-1, 1000000)
for i in range(bm, bM):
  print(i, end=' ')
print(bM)

Submission status: Accepted

Solution code:
def resolve():
    k,x = map(int,input().split())
    if k == 1:
        print(x+k-1)
    else:
        for i in reversed(range(k)):
            print('{} '.format(x-i),end='')
        for i in range(1,k-1):
            print('{} '.format(x+i),end='')
        print(x+k-1)
resolve()

Submission status: Accepted

Solution code:
K,X = input().split()
k = int(K)
x = int(X)
start = x - (k - 1)
end = x + (k - 1)
for i in range(start,end+1):
    print(i,end = ' ')

Submission status: Accepted

Solution code:
K,X = map(int, input().split())
minX = X-K+1
maxX = X+K-1
Answer = list(range(minX,maxX+1))
print(*Answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K,X=(int(x) for x in input().split())
min=X-K+1
max=X+K-1

if min<=0:
  total=max-min+1
  for g in range(total):
    print(min+g,end=" ")
elif min>0:
  total=max-min+1
  for g in range(total):
    print(min+g,end=" ")

Submission status: Accepted

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

min_x = x - (k - 1)
max_x = x + k

ans_list = []

for i in range(min_x, max_x):
    ans_list.append(i)

ans_str = [str(a) for a in ans_list]
ans = " ".join(ans_str)
print(ans)

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
sta = a[1]
num = a[0] - 1
j = sta - num
h = sta + num
ans = ""
for i in range(j,h+1,1):
    ans = ans + " " + str(i)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

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

mi = x-k+1
mi = max(-1000000, mi)

ma = x+k
ma = min(1000000, ma)

list_1 = list(range(mi, ma))
print(" ".join(map(str,list_1)))

Submission status: Accepted

Solution code:
k, x = map(int, input("").split())
a = max([x-k+1, -1000000])
b = min([x+k-1, 1000000])
m = range(a, b)
m2 = list(range(a, b))
print(" ".join(map(str, list(range(a, b + 1)))))

Submission status: Accepted

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

ans=[]

lx=max(-1000000,x-k+1)
rx=min(1000000,x+k-1)

if k ==1:
    print(x)
else:
    for i in range(lx,x):
        ans.append(str(i))
    ans.append(str(x))
    for i in range(x+1,rx+1):
        ans.append(str(i))
    print(" ".join(ans))

Submission status: Accepted

Solution code:
a = input().split()

n = int(a[0])
m = int(a[1])

a1 = m - (n - 1)
a2 = m + (n)

max = 1000000
min = -1000000

if a1 < min:
    a1 = min
if a2 > max:
    a2 = max

l = map(str, range(a1, a2))
print(' '.join(l))

Submission status: Accepted

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

#p=X+1-K if X+1-K>=0 else 0

#q=X+K if X+K>
    
  
for i in range(X+1-K,X+K):  
  print(i,end=" ")
 # print(" ",end="")

Submission status: Accepted

Solution code:
K, X = map(int, input().split())
L = []
for i in reversed(range(1,K)):
    L.append(X-i)

L.append(X)

for i in range(1,K):
    L.append(X+i)

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

Submission status: Accepted

Solution code:
k,x = (int(x) for x in input().split())

length = k * 2 - 1

if x - k < -1000000:
	firstNo = -1000000
elif x + k > 1000000:
	firstNo = 1000000 - length + 1
else:
	firstNo = x - k + 1
for i in range(length):
	print(str(firstNo + i) + " ", end = "")

Submission status: Accepted

Solution code:
k,x=map(int, input().split()) 
xmin = x-(k-1)
xmax = x+(k-1)
L = []
for i in range(xmin,xmax+1):
    L.append(i)
print(' '.join(map(str, L)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Aug 10 21:07:21 2019

@author: doppe
"""

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


start = X - K + 1
end = X + K
split = ""
ans = ""
for i in range (start, end):
    ans += split + str(i)
    split = " "
print(ans)

Submission status: Accepted

Solution code:
k,x= map(int, input().split())
l=max(x-k+1,-1000000)
r=min(x+k-1,1000000)
t=[str(i) for i in range(l,r+1)]
t=' '.join(t)
print(t)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int, input().rstrip().split(" ")))

print(" ".join(list(map(str, [i for i in range(l[1]-l[0]+1, l[1]+l[0])]))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k, x = map(int, input().split())
mx = x + (k - 1)
mn = x - (k - 1) 
print(' '.join(map(str, list(range(mn, mx + 1)))))

Submission status: Accepted

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

Submission status: Accepted

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

if (X + (K - 1)) <= 1000000:
    ans = [str(i) for i in range(X - (K - 1), X + (K - 1) + 1)]

elif (X - (K - 1)) >= -1000000:
     ans = [i for i in range(X - (K - 1), X + (K - 1) + 1)]

print(' '.join(ans))

Submission status: Accepted

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

saisyou = 0
saidai = 0

saisyou = X - K + 1
saidai = X + K - 1

for i in range(saisyou,saidai+1):
  print(i,end=" ")

Submission status: Accepted

Solution code:
x,y = list(map(int, input().split(" ")))

re = list(map(lambda a: str(a+y-x+1), range(2*x-1)))

print(" ".join(re))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2**31-1)
input = sys.stdin.readline
write = sys.stdout.write
LMIIS = lambda : list(map(int,input().split()))
II = lambda : int(input())
dbg = lambda *something : print(*something) if DEBUG is True else 0
DEBUG = True

def main():
    K, X = LMIIS()
    for i in range(X-K+1,X+K):
        print(i)





    pass
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
k, x= map(int, input().split())
if x-k+1 < -1000000:
	s = -1000000
else:
	s = x-k+1
if x+k-1 >1000000:
	f = 1000000
else:
	f = x+k-1
for i in range(s,f):
	sys.stdout.write(str(i))
	sys.stdout.write(" ")
sys.stdout.write(str(f))

Submission status: Accepted

Solution code:
k, x = map(int, input().split())
if abs(x + 1000000) < 2 and x<0:
  for i in range(-1000000, x + k):
    print(i,end=" ")
  exit()
elif abs(x - 1000000) < 2 and x > 0:
  for i in range(x - k + 1,1000000+1):
    print(i,end=" ")
  exit()
else:
  for i in range(x - k + 1, x + k):
    print(i,end=" ")
  exit()

Submission status: Accepted

Solution code:
inlist = input().split()
a = int(inlist[0])
b = int(inlist[1])

ans = []
for i in range(0,a):
	if (i==0):
		ans.append(b)
	else:
		if not (a-i < -1000000):
			ans.append(b-i)
		if not (a+i > 1000000):
			ans.append(b+i)
ans.sort()
string= ''
for i,a in enumerate(ans):
	string += str(a)
	if not (i==len(ans)-1):
		string += ' '

print(string)

Submission status: Accepted

Solution code:
k, x = map(int, input().split())
start_ = x - k + 1
for i in range(k + (k - 1)):
    if i == (k + (k - 1) - 1):
        print(start_ + i)
    else:
        print(start_ + i, end=" ")

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

l = x - k + 1
r = x + k - 1

mylist = []

for i in range (l,r + 1):
	print(i, end=" ")

Submission status: Accepted

Solution code:
K,X = map(int,input().split())
MAX = 1000000
MIN = -1000000
A = []
for k in range(max(MIN,X-K+1),min(MAX,X+K)):
    A.append(k)
print(*A)

Submission status: Accepted

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

Submission status: Accepted

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


Xmin = X-K+1
Xmax = X+K-1

if Xmin < -1000000:
  Xmin = -1000000

if Xmax>1000000:
  Xmax=1000000
  
Xrange = list(range(Xmin,Xmax+1,1))

print(" ".join( repr(e) for e in Xrange ) )

Submission status: Accepted

Solution code:
import numpy as np

K,X=input().split()

K=int(K)
X=int(X)

array=np.arange(X-K+1,X+K,1)

print(array[0],end='')

for n in range(len(array)-1):
    print(' {}'.format(array[n+1]),end='')

Submission status: Accepted

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

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

print(' '.join(li))

Submission status: Accepted

Solution code:
K, X = map(int, input().split())
l = X - K + 1
r = X + K
print(*list(range(l, r)))

Submission status: Accepted

Solution code:
l = raw_input().split() 
K=int(l[0])
X=int(l[1])

min=0
max=0

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

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

Submission status: Accepted

Solution code:
K,X=(input().split(' '))
K=int(K)
X=int(X)
ans=[]
for i in range(1,K*2):
    ans.append(str(X-K+i))
print(' '.join(ans))

Submission status: Accepted

Solution code:
import sys
k, x = map(int, input().split())

s = max(-1000000, x-k+1)
e = min(x+k-1, 1000000)
for i in range(s,e+1):
    if i == e:
        sys.stdout.write("{}".format(i))
    else:
        sys.stdout.write("{} ".format(i))

Submission status: Accepted

Solution code:
i= input().split()
j=int(i[0])
k=int(i[1])
l=k-j+1
m=[]
for n in range(j*2-1):
	m.append(l+n)

print(*m)

Submission status: Accepted

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

lowx = x-k+1
lowy = x+k
ans_l = []

for i in range(lowx, lowy):
    ans_l.append(str(i))

print(' '.join(ans_l))

Submission status: Accepted

Solution code:
from sys import stdin


def main():

    K, X = [int(x) for x in stdin.readline().rstrip().split()]

    a = X-(K-1)
    b = X+(K-1)

    if a < -1000000:
        a = -1000000

    if b > 1000000:
        b = 1000000

    # print(a, b)
    c = list(range(a, b+1))

    # print(c)
    print(" ".join(map(str, c)))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
k,x = map(int,input().split())
big = x+k-1
small = x-k+1
if small < -1000000:
  for i in range in(-1000000,big+1):
    print(i,"",end='')
elif big > 1000000:
  for i in range in (small,1000000+1):
    print(i,"",end='')
if small >= -1000000 and big <= 1000000:
  for i in range(small,big+1):
    print(i,"",end='')

Submission status: Accepted

Solution code:
#coding utf-8

n,k = map(int, input().split())
# d = list(map(int,input().split()))

x = list()
x.append(k)

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

x.sort()

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

Submission status: Accepted

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

if K == 1:
    print(X)
else:
    print(X-(K-1), end="")
    for i in range(X-(K-1)+1, (X+K)):
        print(' %d' % i, end="")

Submission status: Accepted

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

list=[]

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

Submission status: Accepted

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

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

print(" ".join([str(i) for i in range(start, end+1)]))

Submission status: Accepted

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

count = (k - 1) * 2 + 1
ans_arr = []

for i in range(x - (k - 1), x):
    ans_arr.append(str(i))

for i in range(x, x + k):
    ans_arr.append(str(i))

print(' '.join(ans_arr))

Submission status: Accepted

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

right= (1000000)*(-1)
left=1000000
al=[]
for i in range(x-(k-1),x+1):
  if i<right or left<i:
    continue
  for j in range(k):
    t=i+j
    if (i+j in al)!=True and (t<right)==False and (left <t)==False:
      al.append(i+j)
  

al.sort()
print(*al)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k, n = (int(x) for x in input().split())

result = []
dif = n - k + 1
r = (2 * (k - 1)) + 1
for i in range(r):
    result.append(str(dif + i))

print(" ".join(result))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# B
k,x = map(int,input().split())
min = x - (k-1)
max = x + (k-1)
ans = [i for i in range(min,max+1)]
print(*ans)

Submission status: Accepted

Solution code:
import sys
K,X = map(int,input().split())

KK = K -1
KKK = K*2-1

li = []

for i in range(KKK):
    li.append(X - KK + i)

for j in li:
    print(j, end=' ')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k, x = map(int, input().split())
print(*[i for i in range(max(x-k+1, -10**6), min(x+k, 10**6+1))])

Submission status: Accepted

Solution code:
k, x = map(int,input().split(' '))
if x-k+1 <= -100000:
    for i in range(0,k):
        print(-100000+i,sep=' ',end=' ')
elif x+k-1 >= 100000:
    for i in range(0,k):
        print(100000-i,sep=' ',end=' ')
else:
    for i in range(k,1,-1):
        print(x-i+1,sep=' ',end=' ')
    for i in range(0,k):
        print(x+i,sep=' ',end=' ')

Submission status: Accepted

Solution code:
a, x = map(int, input().split())

line = []
for i in range(x-a+1, x+a):
  line.append(i)

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

Submission status: Accepted

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

length = K - 1

start = X - length
end = X + length

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

Submission status: Accepted

Solution code:
a, b = (int(i) for i in input().split())
c = []
d=2*a-1
for i in range(d):
  c.append(b-a+1+i)
  
print(*c)

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))

count = i[0] + i[0] - 1
min = i[1] - i[0] + 1

for x in range(count):
    print(min+x)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# 標準入力
K, X = map(int, input().split())
#input_num_str= input()
#input_num = int(input())

# スペース区切りの整数の入力
#num_list = list(map(int,input().split()))

min = X - (K - 1)
max = X + (K - 1)
len = max - min +1

result = ''
for i in range(min,max + 1):
    result = result + str(i) + ' '

print(result)

Submission status: Accepted

Solution code:
tmp = input().split(' ')

k = int(tmp[0])
x = int(tmp[1])

a = k - 1
b = x - a
c = x + a

resulttmp = ''

if k == 1:
    resulttmp = str(x)
else:
    for i in range(b,c+1):
        resulttmp += str(i) + ' '

print(resulttmp)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
K,X = map(int,input().split())
ans = [X]

for i in range(1,K):
    if X+i <= 1000000:
        ans.append(X+i)
    if X-i >= -1000000:
        ans.append(X-i)

ans = sorted(ans)
print(*ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def main():

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

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






    
if __name__== "__main__":
    main()

Submission status: Accepted

Solution code:
k,x=map(int,input().split())
pos=[]
for i in range(x-k+1,x+k):
  if -1000000<=i and i<=1000000:
    pos.append(i)

for idx,el in enumerate(pos):
  if idx==0:
    print(el,end='')
  else:
    print(' '+str(el),end='')
print()

Submission status: Accepted

Solution code:
K,X=map(int,input().split())
Ma=X+K-1
mi=X-K+1
if Ma>1000000:
  M=1000000
else:
  M=Ma
if mi<-1000000:
  m=-1000000
else:
  m=mi
ls=[str(i) for i in range(m,M+1)]
print(' '.join(ls))

Submission status: Accepted

Solution code:
k,x = map(int, input().split())
mi = x - k + 1
ma = x + k - 1
t_min = max(mi, -1000000)
t_max = min(ma, 1000000)
L = list(range(t_min, t_max+1))
arr = [str(i) for i in L]
arr=' '.join(arr)
print(arr)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
K = A[0]
X = A[1]
s = K - 1
ans = []
for i in range(X-s, X+s+1):
  ans.append(i)

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

Submission status: Accepted

Solution code:
def one_clue(k,x):
    j = k
    y = []
    for i in range(k,k*3-1):
        j -= 1
        y.append(x - j)

    return y

if __name__ == '__main__':
    k,x = map(int,input().split())

    ans = one_clue(k,x)
    for i in range(len(ans)):
        print(ans[i],end=" ")
    print("")

Submission status: Accepted

Solution code:
k,x = map(int, input().split())
ans = []

for i in range(x-k+1, x+k):
    
    if x-k+1 < -10000 or k+x > 10000:
        continue
    else:
        ans.append(i)


print(*ans)

Submission status: Accepted

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

ans = []

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

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

Submission status: Accepted

Solution code:
#
K,X = map( int, input().split())
n = K - 1
spos = X - n
epos = X + n 

if spos < -1000000:
    spos = -1000000
if epos > 1000000:
    epos = 1000000

for i in range(spos,epos+1,1):
    print(i,end=' ')

Submission status: Accepted

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

print(" ".join(repr(i) for i in cule))

Submission status: Accepted

Solution code:
def inpl():
    return list(map(int, input().split()))


K, X = inpl()

ans = [i for i in range(X-K+1,K+X)]

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

Submission status: Accepted

Solution code:
import numpy as np
k,x = map(int,input().split())

for i in range(1,2*k):
    print(str(x-np.abs(k)+i)+" ",end="")

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

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

left = X - (K - 1)
right = X + (K - 1)

out_str = ''
for i in range(left, right+1):
    if i == right:
        out_str += str(i)
    else:
        out_str += str(i) + ' '
print(out_str)

Submission status: Accepted

Solution code:
K, X = list(map(int, input().split()))
min_val = X - (K - 1)
min_val = -1000000 if min_val < -1000000 else min_val
max_val = X + (K - 1)
max_val = 1000000 if max_val > 1000000 else max_val
result = ''
for i in range(min_val, max_val + 1, 1):
  result += '{} '.format(i)
print(result.rstrip())

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
pwd = B - (A - 1)
max = B + (A - 1)

while(pwd <= max):
  print(pwd,end="")
  print(" ",end="")
  pwd += 1

Submission status: Accepted

Solution code:
K,X=map(int,input().split())
ans = ''
for i in range(X-K+1,X+K):
    ans+=str(i)
    ans+=' '

print(ans[:-1])