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:
def fa(K,X):
    ch=""
    L=[X]
    for i in range(0,K-1):
        L.append(X-i+2)
        L.append(X+i-2)
    Q=set(L)
    C=str(Q)
    ch=C[1:len(C)-1]
    return ch
K,X=map(int,input().split())
print(fa(K,X).replace(",",""))

Submission status: Wrong Answer

Solution code:
def fa(K,X):
    L=[X]
    for i in range(0,K-1):
        L.append(X-i+2)
        L.append(X+i-2)
    return set(L)
K,X=map(int,input().split())
print(fa(K,X))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K, X = map(int, input().split())
S = X -(K-1)
while True:
    if S > X + (K -1):
        break
    print(S, end="")
    S += 1
print("")

Submission status: Wrong Answer

Solution code:
K, X = map(int, input().split())
S = X -(K-1)
while True:
    if S > X + (K -1):
        break
    print(S, end="")
    S += 1

Submission status: Wrong Answer

Solution code:
n,m = list(map(int, input().split()))
if n==1:
  print(m)
else:
  ans = [m]
  for i in range(n-1):
    ans.append(m-(n-i)+1)
    ans.append(m+i+1)
  print(ans)

Submission status: Wrong Answer

Solution code:
n,m = list(map(int, input().split()))
if n==1:
  print(m)
else:
  ans = []
  for i in range(2*(n-1)):
    ans.append(m-(n-i)+1)
  print(ans)

Submission status: Wrong Answer

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

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

lst2 = sorted(lst1)
lst3 = list(set(lst2))

print(' '.join([str(_) for _ in lst3]))

Submission status: Wrong Answer

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

for i in range(k):
    lst1.append(str(x-i))
    lst1.append(str(x+i))

lst2 = sorted(list(set(lst1)))

print(' '.join(lst2))

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())
list = []
for i in range(0, k):
    list.append(x-i)
for j in range(0, k):
    list.append(x+j)
list.sort()
list.remove(x)
print(list)

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())
list = []
for i in range(0, k):
    list.append(x-i)
for j in range(0, k):
    list.append(x+j)
list.sort()
print(set(list))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = []
tmp = []
A,B = map(int,input().split())
b = B-(A-1)
for i in range(3*2-1):
  if A == 1:
    a.append(B) 
  else:
    a.append(b+i)
while a:
  e = a.pop()
  if e <= 10000000 and e>=-10000000:
    tmp.append(e)
tmp = sorted(tmp)
tmp = [str(n) for n in tmp]
p =' '.join(tmp)
print(p)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k,x=map(int,input().split())
a=[]
for i in range(k):
    if i==0:
        a.append(x)
        continue
    a.append(x+i)
    a.append(x-i)
b=sorted(a)
print(b)

Submission status: Wrong Answer

Solution code:
while True:
    L=lambda:list(map(int,input().split()))
    k,x=L()
    if x>=0 and x<=100 and k>=1 and k<=100:
        break
c =[]
for i in range(x-k+1,x+k,1):
    c.append(i)
c = [str(int) for int in c]
' '.join(c)

Submission status: Wrong Answer

Solution code:
import sys

if sys.platform =='ios':
	sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(input())
def MAP(): return [int(s) for s in input().split()]

a, b = MAP()
c = list(range(b-(a-1),b+(a)))
print(c)
print(' '.join(map(str,c)))

Submission status: Wrong Answer

Solution code:
K, N = map(int, input().split())
L = [v for v in range(N - K, N, 1)]
R = [v for v in range(N, N+K, 1)]
L.extend(R)
set(L)
print(sorted(list(L)))

Submission status: Wrong Answer

Solution code:
K, N = map(int, input().split())
L = [v for v in range(N - K, N, 1)]
R = [v for v in range(N, N+K, 1)]
L.extend(R)
print(sorted(L))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


def solve():
    _min = -1000000
    _max = 1000000

    if (x - k + 1) > _min:
        _min = x - k + 1
    if (x + k - 1) < _max:
        _max = x + k - 1

    ans = list(map(str, range(_min, _max + 1)))

    return ''.join(ans)


print(solve())

Submission status: Wrong Answer

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


def solve():
    _min = -1000000
    _max = 1000000

    if (x - k + 1) > _min:
        _min = x - k + 1
    if (x + k - 1) < _max:
        _max = x + k - 1

    return list(range(_min, _max + 1))


print(solve())

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 = [int(x) for x in input().split()]



print((X - (K - 1)), (X - (K - 2)), X,(X + (K - 2)), ((X + (K - 1))))

Submission status: Wrong Answer

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

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

    # calc
    first = x - k - 1
    last = x + k - 1
    while first <= last:
        print(first, end=' ')
        first += 1

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
for i in range(max(-1000000, a[1]-a[0]+1), min(1000000,a[1]-a[0]+1)+1) :
  print(i,end = " ")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

k = kx[0]
x = kx[1]
ans = [i for i in range(x-k+1, x+k, 1) if (1000000 >= i) and (i >= -1000000) ]

for a in ans:
    print(a, end ="")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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+= [i]

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())
if k > 1:
    black = [i for i in range(x-k+1,x+k) if -10**6 <= i <= 10*6]
    print(*black)
else:
    print(x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# https://atcoder.jp/contests/abc137/tasks/abc137_b
k, x = map(int, input().split())
if k == 1:
    print(x)
    exit()
print(" ".join(map(str, list(range(x - k + 1, x + k - 1)))))

Submission status: Wrong Answer

Solution code:
# https://atcoder.jp/contests/abc137/tasks/abc137_b
k, x = map(int, input().split())
print(" ".join(map(str, list(range(x - k + 1, x + k - 1)))))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a=[]
for i in range(X-K+1,X):
    a.append(i)
for i in range(X,X+K):
    a.append(i)
set(list(a))

print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(*ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# abc137B - One Clue
K, X = list(map(int,input().split()))
left = max(-1000000,X-K+1)
right = min(1000000,X+K-1)
if left == right:
    print(left)
else:
    ans = [str(i) for i in range(left,right+1,1)]
    print(ans)
    print(' '.join(ans))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = list(map(int, input().split()))
R,O = L[0],L[1]
 
S = O + (R-1)
I = O - (R-1)
 
L = [i for i in range(I,S+1) if i <= 100000 and i >= -100000 ]
if len(L) == 0:
  print(O)
else:print(L)

Submission status: Wrong Answer

Solution code:
L = list(map(int, input().split()))
R,O = L[0],L[1]

S = O + (R-1)
I = O - (R-1)

L = [i for i in range(I,S) if i <= 100000 and i >= -100000 ]
if len(L) == 0:
  print(O)
else:print(L)

Submission status: Wrong Answer

Solution code:
L = list(map(int, input().split()))
R,O = L[0],L[1]

S = O + (R-1)
I = O - (R-1)

L = [i for i in range(I,S) if i <= S and i >= I ]
if len(L) == 0:
  print(O)
else:print(L)

Submission status: Wrong Answer

Solution code:
L = list(map(int, input().split()))
R,O = L[0],L[1]

S = O + (R-1)
I = O - (R-1)

L = [i for i in range(I,R)]
if len(L) == 0:
  print(O)
else:print(L)

Submission status: Wrong Answer

Solution code:
L = list(map(int, input().split()))
R,O = L[0],L[1]

S = O + (R-1)
I = O - (R-1)

L = [i for i in range(I,R)]
print(L)

Submission status: Wrong Answer

Solution code:
n=[int(i) for i in input().split()]
for i in range(-(n[0]-1),n[0]-1):
  print(n[1]+i,end=" ")

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
k,x=map(int,input().split())

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

#出力ちがうかも

Submission status: Wrong Answer

Solution code:
K,X = list(map(int, input().split()))
ans = [X]
count = 1
for stone in range(K-1):
    if X + count <= 1000000:
        ans.append(X + count)
    if X - count >= -1000000:
        ans.insert(0, X - count)
    count += 1
print(ans)

Submission status: Wrong Answer

Solution code:
K,X = list(map(int, input().split()))
ans = [X]
count = 1
for stone in range(K-1):
    if X - count < -1000000 or X + count > 1000000:
        break
    ans.append(X + count)
    ans.insert(0, X - count)
    count += 1
print(ans)

Submission status: Wrong Answer

Solution code:
K,X = list(map(int, input().split()))
ans = [X]
count = 1
for stone in range(K-1):
    ans.append(X + count)
    ans.insert(0, X - count)
    count += 1
print(ans)

Submission status: Wrong Answer

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

a = []

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

s_a = sorted(a)
print(s_a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

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

Submission status: Wrong Answer

Solution code:
K,X=map(int,input().split())
ans = []
for i in range(-101,101):
  if K == 0:
    ans.append("0")
    break
  elif X-K<i<X+K:
    ans.append(str(i))
ans=" ".join(ans)
print(ans)

Submission status: Wrong Answer

Solution code:
K,X=map(int,input().split())
ans = []
for i in range(-100,101):
  if X-K<i<X+K:
    ans.append(str(i))
ans=" ".join(ans)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K,X=map(int,input().split())
ans = []
for i in range(-100,101):
  if X-K<i<X+K:
    ans.append(str(i))
print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np
X,K = map(int,input().split())
a=list(np.arange(np.max([-1000000,X-K+1]),np.min([1000000,X+K-1])))
print(' '.join(map(str, a)))

Submission status: Wrong Answer

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

def main():
    nyuuryoku = list(map(int, input().split()))
    k = nyuuryoku[0]
    x = nyuuryoku[1]
    num_list = []

    num_list.append(x)

    for i in range(k):
        if(x+i < 100000):
            num_list.append(x+i)

    for i in range(k):
        if(x-i > -100000):
            num_list.append(x-i)

    num_list_uniq = sorted(list(set(num_list)))
    print(num_list_uniq)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

def main():
    nyuuryoku = list(map(int, input().split()))
    k = nyuuryoku[0]
    x = nyuuryoku[1]
    num_list = []

    num_list.append(x)

    for i in range(k):
        if(x+i < 100000):
            num_list.append(x+i)

    for i in range(k):
        if(x-i > -100000):
            num_list.append(x-i)

    num_list_uniq = list(set(num_list))
    print(num_list_uniq.sort())

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print([x for x in range(x-k+1,x+k-1)])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k,x = map(int,input().split())
li =  []
for i in range(k):
    if i == 0:
        li.append(x)
    else:            
        li.append(x+i)
        li.append(x-i)
print(sorted(li))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

c = set(c)
print("test",sorted(c))

Submission status: Wrong Answer

Solution code:
K,X = map(int, input().split());i = X-K+1
while i < K:
    print(X+i)
    i += 1

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())
print(2 * (k - 1) + 1)

Submission status: Wrong Answer

Solution code:
k, x = map(int,input().split())#標準入力を行う

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

y = []

for i in range(a,b):
    y.append(i)
print(*y,sep=',')

Submission status: Wrong Answer

Solution code:
s = input().split()
stones = [i for i in range(-1000000, 1000001, 1)]
min, max = -1000000+(int(s[1])-int(s[0])), -1000001+(int(s[1])+int(s[0]))
print(stones[min:max])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if k > 1:
    x -= k - 1
    for i in range(k*2 - 1):
        numlist.append(x + i)
else:
    numlist.append(x)

print(numlist)

Submission status: Wrong Answer

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

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:
a,b=map(int,input().split())
x=b-a+1
for i in range(x,a):
  print(i,end=" ")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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

min_x = k - x + 1
if(min_x < -1000000):
	min_x = -1000000

max_x = k + x - 1
if(max_x > 1000000):
	max_x = 1000000

for i in range(min_x,max_x+1):
	sys.stdout.write(str(i))
	if i != max_x:
		sys.stdout.write(" ")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K,X = list(map(int, input().split()))
Xmin = max(X-K+1, -1000000)
Xmax = min(X+K-1, 1000000)
ans = list(range(Xmin,Xmax+1,1))
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
A=list()
for n in range(b-a+1,b+a):
  A.append(n)
print(A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

upper = x + k - 1
lower = x - k + 1 

print(np.arange(lower, upper))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())
output_num = (k*2)-1
start_num = x-(k-1)
print(*range(start_num, output_num))

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())
output_num = (k*2)-1
start_num = x-(k-1)
print(*range(start_num, output_num, 1))

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())
output_num = (k*2)-1
start_num = x-(k-1)
print(range(start_num, output_num, 1))

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())
output_num = (k*2)-1
start_num = x-(k-1)
print(list(range(start_num, output_num, 1)))

Submission status: Wrong Answer

Solution code:
delta, base = map(int, raw_input().split())
print range(base - delta + 1, base + delta)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K,X=map(int, input().split())
s1=set([])
s2=set([])
for i in range(K):
  s1.add(X-i)
  s2.add(X+i)
s=s1|s2
print(s)

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())
a = ""
if x - k + 1 >= 0:
    s = x - k + 1
    ans = list(range(s, s+2*k-1))
else:
    s = x - k + 1
    ans = list(range(s, k))
for i in range(len(ans)):
    a += str(ans[i])+" "
print(a[:-1])

Submission status: Wrong Answer

Solution code:
s = input().split()
K = int(s[0])
X = int(s[1])
a = list(range(X-K+1, X+K))
print(a)

Submission status: Wrong Answer

Solution code:
s = input().split()
K = int(s[0])
X = int(s[1])
a = list(range(X-K, X+K))
print(a)

Submission status: Wrong Answer

Solution code:
s = input().split()
K = int(s[0])
X = int(s[1])
a = list(range(X-K, X+K+1))
print(a)

Submission status: Wrong Answer

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

list_b = []

for i in range(2*k-1):
    list_b.append(x-k+i+1)

print(list_b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# 2,000,001 個の石が並べられている
# K個の連続した石が黒、他は白
# 座標Xが黒の時、黒の存在範囲を全て小さい順に表示する

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

for i in range(x-k, x+k):
    if 0 <= i <=100 :
        print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# スペース区切りの整数の入力
K, X = map(int, input().split())
# 最大最小を出力
A = X + (K - 1)
B = X - (K - 1)
# 出力
print(list(range(B, A+1)))

Submission status: Wrong Answer

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

a = X - (K - 1)
b = X + (K - 1)
c = []
for i in range(a,b+1):
  c.append(i)
print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k,x = map(int,input().split())
a = x+k
b = x-k+1
c = list(range(a,b)) 
print(" ".join([str(n) for n in c]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k,x = map(int,input().split())
a = x+k
b = x-k+1
if a-1>=1000000:
  a = 1000001
if b<=-1000000:
  b = -1000000
print(list(range(b,a)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


minnum = t[1] - t[0] + 1
length = t[0]*2 - 1

output=[]
for i in range(length):
    output.append(minnum+i)

print(output)

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:
K,X = map(int,input().split())
print(list(range(X-K+1,X+K-1)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K, X = map(int, input().split())
l, r = 0, 2000001
l = max(X - K + 1, l)
r = min(X + K - 1, r)
lr = range(l, r)
print(*lr)

Submission status: Wrong Answer

Solution code:
K, X = map(int, input().split())
l, r = 0, 2000000
l = max(X - K + 1, l)
r = min(X + K - 1, r)
lr = range(l, r + 1)
print(*lr)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

x=0
R=[]

for i in range(K*2-1):
    x=X+1*i
    R.append(x)
    
print(' '.join(map(str,R)))

Submission status: Wrong Answer

Solution code:
A = list(map(int, input().split()))
B = []
for i in range(A[0] * 2 -1):
  B.append(A[1]-A[0] + i+1)
print(B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = []

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

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

Submission status: Wrong Answer

Solution code:
K,X = map(int,input().split())
i = X - K + 1
lis = []
while i <= X + K - 1:
  lis.append(i)
  i += 1
print(lis)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

res = []
if k == 1:
    print(x)
else:
    for i in range(1, k):
        res.append(x + i)
    for i in range(1, k):
        res.append(x - i)
    res.append(x)
    print(sorted(res))

Submission status: Wrong Answer

Solution code:

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

axis = list(range(-1000000, 1000001, 1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k , x = map(int,input().split())
for i in range(x-k+1,x+k-2) :
    print(str(i), end=" ")
print(str(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())
lst=[]
for i in range(1,2*k):
  lst.append(x-k+i)
print(lst)

Submission status: Wrong Answer

Solution code:
a, b = map(lambda x: int(x), input().split())
ans = list(range(a*2-1))
ans = [x + b - a + 1 for x in ans]
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- encoding: UTF-8 -*-
k , x = map(int, input().split())

x_min = x - k + 1
x_max = x + k - 1

x_list = list(range(x_min, x_max+1))
maped_list = map(str, x_list)
mojiretsu = ','.join(maped_list)

print(mojiretsu)

Submission status: Wrong Answer

Solution code:

S = input().split()
K = int(S[0])
X = int(S[1])
s = X-K+1
e = X+K-1
for i in range(s, e-1):
    print(str(i)+' ')
print(e)