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: Wrong Answer

Solution code:
a,b = [int(x) for x in input().split()]
print(max([a + b,a-b,a*b]))

Submission status: Wrong Answer

Solution code:
import math
a,b=map(int,input().split())
z = []
for i in range(int(math.ceil((a*2+1))/2) * -1,int(math.ceil((a*2+1))/2)):
  z.append(str(int(b-(b/2)+i + 1)))
print(" ".join(z))

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

print(ans.tolist())

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

print(ans.tolist)

Submission status: Wrong Answer

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

i = x - k + 1
max = x + k -1

ans = list()

while i <= max:
  ans.append(i)
  i = i + 1

print(ans)

Submission status: Wrong Answer

Solution code:
lines = input().split(" ")
K = int(lines[0])
X = int(lines[1])
arr = []
 
if K == 1:
  print(X)
else:
  for i in range(X , X + K):
    arr.append(i)
    
  for j in range(X - K + 1 , X):
    arr.append(j)
    
arr.sort()
print(arr)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# One Clue
N, X = map(int,input().split())

ans_1 = X-N+1
ans_2 = X+N
ans = list(range(ans_1,ans_2,1))

print(ans)

Submission status: Wrong Answer

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

mini = x - k + 1
maxi = x + k - 1

l = list(range(max([mini,-1000000]),min([1000000,maxi])))
if not l:
  print(x)
else:
  print(l)

Submission status: Wrong Answer

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

min = b - (a - 1)
max = b + (a - 1)

print(range(min,(max)))

Submission status: Wrong Answer

Solution code:
k,x = map(int,input().split())
c = [str(x)]
for y in range(k):
  if k==1:
    break
  elif y == x or y == 0:
    continue
  else:
    if x+y < 1000000:
      c.append(str(x+y))
    if x-y > -1000000:
      c.insert(0,str(x-y))
print(' '.join(c))

Submission status: Wrong Answer

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

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

if a == b:
    print(a)
else:
    r = list(range(a, b))
    print(' '.join(map(str, r)))

Submission status: Wrong Answer

Solution code:
def main():
    a, b = map(int, input().split())
    result = a * 2 - 1
    print(result)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
k,x=map(int, input().split())
a = list()
 
b = x+k-1
c = x-k+1
 
for i in range(c,b+1):
  if  -1000000 <= i and i <= 1000000:
    a.append(i)
  
print(a,sep=" ")

Submission status: Wrong Answer

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

result = np.arange(x-k+1,x+k-1,1,dtype = 'int')

print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
li = list(map(int,input().split()))
lists = []
for i in range(li[0]*2-1):
    lists.append(li[1]-li[0]+i+1)
print(lists)
moji = ""
for s in range(len(lists)):
    moji += " "+str(lists[s])
print(moji)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
lines = input().split(" ")
K = int(lines[0])
X = int(lines[1])
arr = []
 
if K == 1:
  print(X)
else:
  for i in range(X + K):
    arr.append(i)
    
  for j in range(X - K + 1 , X):
    arr.append(j)
    
arr.sort()
print(arr)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k,x=map(int, input().split())
a = list()
 
b = x+k-1
c = x-k+1
 
for i in range(c,b+1):
  if  -1000000 <= i and i <= 1000000:
    a.append(i)
  
print(a)

Submission status: Wrong Answer

Solution code:
K , X = (int(x) for x in input().split())
st = X - (K - 1)
sp = X + (K - 1)
A = []

for i in range(st , (sp + 1)):
    A.append(i)
print(A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

for i in range(c,b+1):
  if  -1000000 < i and i < 1000000:
    a.append(i)
  
print(a)

Submission status: Wrong Answer

Solution code:
lines = input().split(" ")
K = int(lines[0])
X = int(lines[1])
arr = []

if K == 1:
  print(X)
else:
  for i in range(X + K):
    arr.append(i)
    
  for j in range(X - K , X):
    arr.append(j)
    
arr.sort()
print(arr)

Submission status: Wrong Answer

Solution code:
k,x = map(int,input().split())
c = [str(x)]
for y in range(k):
  if y == x or y == 0:
    continue
  elif k==1:
    break
  else:
    c.append(str(x+y))
    c.insert(0,str(x-y))

print(' '.join(c))

Submission status: Wrong Answer

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)

print(*a,sep=" ")

Submission status: Wrong Answer

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

min = b - (a - 1)
max = b + (a - 1)

print(range(min,(max+1)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

c = b + a - 1
d = b - a + 1

n_list = []

if c == d:
    print(c)
elif c != d:
    max_n = max(c,d)
    min_n = min(c,d)
    for i in range(min_n, max_n+1):
        n_list.append(i)

print(n_list)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

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: Wrong Answer

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

if -1000000 + K < X and X < 1000000 - K:
    print(list(range(X-K+1,K+X)))
if X <= -1000000+K:
    print(list(range(-1000000,X+K)))
if 1000000 - K <= X:
    print(list(range(X-K+1,1000001)))

Submission status: Wrong Answer

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(list_1)

Submission status: Wrong Answer

Solution code:
import numpy as np
n1, n2=input().split(' ')
n1 = int(n1)
n2 = int(n2)
n1_1 = int(n1/2) + 1

result = ''
for  i in range(n2 - n1_1, n2 + n1_1 + 1 ,1):
    result += str(i) + ' '
print(result)

Submission status: Wrong Answer

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))

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

Submission status: Wrong Answer

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: Wrong Answer

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 = '')

Submission status: Wrong Answer

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

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

print([i for i in range(start, end+1)])

Submission status: Wrong Answer

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))

ans_arr.append(str(x))

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

print(' '.join(ans_arr))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = list();

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

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

ans = set(ans)

print(sorted(ans))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np

s = input().split()
a=int(s[0])-1
b=int(s[1])
npdata = np.arange(b-a, b+a, 1)

for s in npdata:
  print(s, end=" ")

Submission status: Wrong Answer

Solution code:
a ,b = map(int,input().split())
n = 0
w = (a-1)*2+1
while n <w:
    x = (b-1)*2-1
    print(n+x,end="")
    n+=1
    if n!=w:
        print(" ",end="")

Submission status: Wrong Answer

Solution code:
data = [int(x) for x in input().split(" ")]

num_0 = int(data[0])
num_1 = int(data[1])
 
for x in range(-num_0,num_0+1):
    print(num_1+x,end=" ")
print("")

Submission status: Wrong Answer

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

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

list=[]
for i in range(min,max+1,1):
    list.append(i)

print(list)

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

s = input().split()
a=int(s[0])
b=int(s[1])
npdata = np.arange(b-a, b+a, 1)

for s in npdata:
  print(s, end=" ")

Submission status: Wrong Answer

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

import numpy as np

tmp = []
for i in range(K[1]-K[0]+1, K[1]+K[0]):
    if abs(i) <= 1000000:
        tmp.append(i)

print(tmp)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

list=[]

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

list=str(list)

print(''.join(list))

Submission status: Wrong Answer

Solution code:
'''
4 0
0 -3
0 -2
0 -1
0 + 0
0 + 1
0 + 2
0 + 3
'''
a ,b = map(int,input().split())
n = 0
w = (a-1)*2+1
while n <w:
    x = (b-1)*2-1
    print(n+x,end=" ")
    n+=1

Submission status: Wrong Answer

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

ans = []

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

print(ans)

Submission status: Wrong Answer

Solution code:
s = input().split() 
k = int(s[0])
x = int(s[1])

aa = x - k + 1
if aa < -1000000:
  aa = 0
bb = x + k - 1
if bb > 1000000:
  bb = 1000000

for i in range(aa, bb-1):
  print(i, end=" ")
  
print(bb)

Submission status: Wrong Answer

Solution code:
K,X=map(int,input().split())
a=range(X+1-K,X-1+K,1)
b=list(a)
print(' '.join(map(str, b)))

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())			# "5 7" -> ["5", "7"] -> 5, 7 => N=5,K=7

x_min = -1000000
x_max =  1000000

l = x_min
r = x_max

l = max( l, x-k+1 )
r = min( r, x+k-1 )

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

print("")

Submission status: Wrong Answer

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

ans=[]

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

if k>2:
    for i in range(lx,x):
        ans.append(str(i))
ans.append(str(x))

if k > 2:
    for i in range(x+1,rx+1):
        ans.append(str(i))

print(" ".join(ans))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
ans = ""
kaisu = a[0] * 2 +1
for i in range(kaisu):
    b = a[1] - a[0] + 1 + i
    ans = ans + str(b) + " "
print(ans[:-1])

Submission status: Wrong Answer

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

lower = X - K + 1
upper = X + K - 1
ans = [i for i in range(lower, upper+1)]
ans_str = " ".join(str(ans))
print(ans_str)

Submission status: Wrong Answer

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(ans)

Submission status: Wrong Answer

Solution code:
s = input().split() 
k = int(s[0])
x = int(s[1])

aa = x - k + 1
if aa < -1000000:
  aa = 0
bb = x + k - 1
if bb > 1000000:
  bb = 1000000

for i in range(aa, bb):
  print(i, end=" ")

Submission status: Wrong Answer

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

lis = list(range(X-K+1,X+K))
print(lis)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
point = [int(i) for i in input().split()] 
point_list = []
for i in range(1,point[0]*2):
    print(i)
    tmp = point[1] - point[0] + i
    point_list.append(tmp)
print(*point_list)

Submission status: Wrong Answer

Solution code:
X,K=map(int,input().split())
A=[]
for i in range(X+K):
  if X-K<i<X+K:
    A+=[i]
for t in A:
  print(t, end = " ")

Submission status: Wrong Answer

Solution code:
import numpy as np

s = input().split()
a=int(s[0])
b=int(s[1])
npdata = np.arange(b-a, b+a, 1)

print(npdata)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(str(list(range(b-a+1,b+a))))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# スペース区切りの整数の入力
b, c = map(int, input().split())
l=b*2-1
ll=[]
lx = c - b + 1
for a in range(l):
    ll.append(lx)
    lx=lx+1
print(ll)

Submission status: Wrong Answer

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

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

li = []

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

print(li)

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
str(list(range(B-(A-1),A+B))).strip('[').strip(']').replace(',','')

Submission status: Wrong Answer

Solution code:
data = [int(x) for x in input().split(" ")]

num_0 = int(data[0])
num_1 = int(data[1])

for x in range(data[0]*2-1):
  print(num_1-x+1,end=" ")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K, X = map(int, input().split())
MIN = -1000000
MAX = 1000000

print(*list(range(max(MIN, X - K + 1), min(MAX, K + X +1))))

Submission status: Wrong Answer

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

ans = list(range(X-K+1, X+K))
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

show_data_list = []

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

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

print(sorted(show_data_list))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K,X = map(int,input().split())
A = []
MAX = 1000000
MIN = -MAX
if K==1:
    print(X)
    exit()
if X-K<MIN:
    for k in range(MIN,X+K):
        A.append(k)
elif X+K>MAX:
    for k in range(X-K+1,MAX+1):
        A.append(k)
else:
    for k in range(X-K,X+K):
        A.append(k)
print(*A)

Submission status: Wrong Answer

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

s = []

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

print(s)

Submission status: Wrong Answer

Solution code:
k = 10
x = 20

head = x-(k-1)
tail = x+(k-1)

ans = str(head)
for i in range(head+1,tail):
    ans = ans + " " + str(i)

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

K = KX[0]
X = KX[1]

MIN = X - (K-1)
MAX = X + (K-1)+1

print(list(range(MIN,MAX)))

Submission status: Wrong Answer

Solution code:

k, x = map(int, input().split())
m = x - k + 1
l = x + k - 1
if l >= 100:
    l = 100

ptn = []
for i in range(m, l+1):
    ptn.append(i)

print(' '.join(list(map(str, ptn))))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = M - N + 1
b = M + N
print(list(range(a,b)))

Submission status: Wrong Answer

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

arr = [x]

for i in range(1, k):
  arr.append(x-i)
  arr.append(x+i)
arr = list(set(arr))
arr.sort()
print(arr)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

k_1 = k - 1

for n in range(x-k_1,x+k_1+1):
  ans.append(n)
  
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(p)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(" ".join([str(_) for _ in range(max(-1000000,x-k+1),min(1000000,x+k-1))]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())
i = max(x - k, -1000000)
c = 0
while (c < k):
    print(i, end=' ')
    c += 1
    i += 1

Submission status: Time Limit Exceeded

Solution code:
K,X=map(int,input().split())
A=""
for i in range(-10000000,10000000):
    if i>=X-K+1 and i<=X+K-1:
       A=A+str(i)+" "
print(A)

Submission status: Time Limit Exceeded

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

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())
ans = [i for i in range(abs(x)-k+1,abs(x)+k)]
for i in ans:
  if -1000000 <= i <= 1000000:
    print(i,'',end='')

Submission status: Accepted

Solution code:
k, x = map(int, input().split())
number = []
# xから前ｋ-1個、後k-1個の数をリストに加える
for i in range(x - (k - 1), x + (k - 1) + 1):
    number.append(i)
# リストの要素を文字列型に変換
number_str = [str(n) for n in number]
# リストの要素をjoinで連結
num = " ".join(number_str)
print(num)

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())
ans_list = [x]
original_x = x

for _ in range(k - 1):
    x = x - 1
    ans_list.append(x)

for _ in range(k - 1):
    if _ == 0:
        x = original_x
    x = x + 1
    ans_list.append(x)

ans_list.sort()
print(' '.join(map(str, ans_list)))

Submission status: Accepted

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

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())
for i in range(x-(k-1),x+k):
    print(i,end=" ")

Submission status: Accepted

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

L = []

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

print(*L)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

def main():
    k, x = map(int, input().split())
    ans = range(x - k + 1, x + k)
    print(*ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
K,X=map(int,input().split())
print(" ".join(map(str,range(X-K+1,X+K))))

Submission status: Accepted

Solution code:
def answer(k: int, x: int) -> str:
    may_be_black = map(str, range(x - k + 1, x + k))
    return ' '.join(may_be_black)


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

k,x=map(int,input().split())
b=[]


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

    b.append(str(i))

b=" ".join(b)

print(b)

Submission status: Accepted

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

min_value = X - K + 1
max_value = X + K
A = []
for i in range(min_value, max_value):
    i = str(i)
    A.append(i)

answer = ' '.join(A)

print(answer)

Submission status: Accepted

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

Y = []

for i in range(X - (K - 1), X + K):
    Y.append(str(i))

print(" ".join(Y))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def ans137(K:int, X:int):
    ansstr=""
    for i in range(-1000000,1000000):
        if abs(X-i)<K:
            ansstr+=str(i)+" "
    return ansstr[:-1]

print(ans137(K,X))

Submission status: Accepted

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


for i in range(-1000000, 2000000, 1):
    if i > X - K and i < X + K:
        print(i)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
k,x=map(int,input().split())
l=max(-1000000,x-k+1)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(*range(X-K+1, X+K))

Submission status: Accepted

Solution code:
#ABC137B

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

Submission status: Accepted

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

min_ans = x-k+1
max_ans = x+k-1

for x in range(min_ans,max_ans+1):
  print(x, end=" ")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k, x = map(int,input().split())
lst = []
for i in range(x - k + 1, x + k):
  if (-1000000 <= i <= 1000000):
    lst.append(i)
for i in range(len(lst)):
    print(lst[i], end = '')
    if (i != len(lst) - 1):
      print(" ", end = '')
print()

Submission status: Accepted

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

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

Submission status: Accepted

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

# K, X = 100程度なので、端点を考慮しなくてよい
# X−K+1,X−K+2,...,X+K−1 の2K−1個を出力すればよい
print(' '.join(map(str, range(X-K+1, X+K))))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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 = map(int, input().split())
ans = []
for i in range(K):
  if i == 0:
    ans.append(X)
  else:
    ans.append(X-i)
    ans.append(X+i)
ans = sorted(ans)
ans = [str(x) for x in ans]
print(" ".join(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)
print(*ans)

Submission status: Accepted

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

if x+(k-1) >= 1000000:
    r = 1000000
else:
    r = x+(k-1)
if x-(k-1) <= -1000000:
    l = -1000000
else:
    l = x-(k-1)

print(' '.join([str(n) for n in range(l, r+1)]))

Submission status: Accepted

Solution code:
K, X = map(int, input().split())
print(' '.join(map(str, range(X-K+1, X+K))))

Submission status: Accepted

Solution code:
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 = map(int,input().split())
first = X - K + 1
second = X + K - 1
if first < -1000000:
    first = -1000000
if second > 1000000:
    second = 1000000
ans = list(range(first,second + 1))
print(*ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k,n = map(int, input().split( ))
arr = list(range(n-k+1, n+k))

print(" ".join([str(n) for n in arr]))

Submission status: Accepted

Solution code:
import sys
pin=sys.stdin.readline
pout=sys.stdout.write

K,X=map(int,pin().split())
for i in range(X-K+1,X+K):
  pout(f"{i} ")
print()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k,x=map(int,input().split())
ans1=x-k+1
ans2=x+k
ans3=[x for x in range(ans1,ans2)]
print(*ans3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


k,x = list(map(int, input().split()))
ans = list(range(x-k+1, x+k))
print(" ".join(map(str, ans)))