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

Submission status: Wrong Answer

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)

print(number)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())
ans = set()
for v in range(k):
	ans.add(x-v)
for v in range(k):
	ans.add(x+v)
ans = list(ans)
print(*ans,sep=" ")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())
L = []
for i in range(k):
    y = x + i
    z = x - i
    if y > 1000000:
        y = x
    L.append(y)
    if z < -1000000:
        z = x
    L.append(z)
print(set(L))

Submission status: Wrong Answer

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

minx,maxx = -1000000, 1000000

if minx + (k-1) > x:
    l = [i for i in range(minx,minx+x+1)]
    print("".join(str(l)))
elif maxx - (k-1) < x:
    l = [i for i in range(maxx-x,maxx+1,-1)]
    print("".join(str(l)))
else:
    l = [i for i in range(x-(k-1),x+(k-1)+1)]
    print("".join(str(l)))

Submission status: Wrong Answer

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

l=0
r=0

if x-(k-1)<-1000000:
  l=-1000000

if x-(k-1)>=-1000000:
  l=x-(k-1)

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

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

print(l)
print(r)

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(max(a * b, a - b, a + b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#入力:N,M(int:整数)
def input2():
	return map(int,input().split())
  
k,x=input2()

st=x-k+1
fi=x+k-1

for i in range(st,fi+1):
	print(i,end="")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
p = list(map(int, input().split()))
ans  = list(range(p[1]-p[0]+1, p[1]+p[0]))
print(ans)

Submission status: Wrong Answer

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

print(" ".join(sorted(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)
  
print(sorted(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# ABC137 B - One Clue

K,L = map(int,input().split())
T = []
for i in range(K):
    T.append(L-i)
for i in range(K):
    T.append(L+i)
    
T = list(set(T))

list.sort(T, reverse=False)
print(''.join(str(T)))

Submission status: Wrong Answer

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

for i in range((k//2) + 2):
  a = x + i
  ans.append(a)
  b = x - i
  ans.append(b)

ans = sorted(set(ans))
ans = map(str, ans)
print(' '.join(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

for j in range(k):
  r.append(x+j)
  
print(r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

l = [x]
for i in range(1, k):
    l.append(x - i)
    l.append(x + i)
l.sort()
print(l)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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:
K, X = map(int, input().split())
print(x for x in range(X-K+1, X+K) if -10**6 <= x >= 10**6)

Submission status: Wrong Answer

Solution code:
K, X = map(int, input().split())
print(X+k-1 for x in range(-K, K) if -10**6 <= X+k-1 >= 10**6)

Submission status: Wrong Answer

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

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

print(LX)

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 = map(int,input().split())
a = x - k + 1
b = x + k
c = list(range(a,b))
print(''.join(str(c)))

Submission status: Wrong Answer

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

a = min(-1000000,x - (k-1))
b = max(1000000,x+(k-1))

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

Submission status: Wrong Answer

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

if X == 1:
    lis.append(K)
else:
    for i in range(K - X +1,K + X -1):
        lis.append(i)

for j in lis:
    print(j,end=" ")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

ans=''
for i in range(-k+1,k):
  if abs(i)<=2000000:
    ans+=str(i)+' '
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,k = map(int, raw_input().split(' '))
ee = range(max(x - k+1,-1000000), min(x + k,1000000))
print ' '.join(map(str,ee))

Submission status: Wrong Answer

Solution code:
k,x = map(int, raw_input().split(' '))
ee = [max(x - k+1,-1000000), min(x + k,1000000)]
print ' '.join(map(str,ee))

Submission status: Wrong Answer

Solution code:
k,x = map(int, raw_input().split(' '))
ee = [max(x - k,-1000000), min(x + k,1000000) + 1]
print ' '.join(map(str,ee))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

for i in range(-k+1,k):
  c.append(str(x-i))
  
c.sort()
print(' '.join(c))

Submission status: Wrong Answer

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

result = []
for i in range(k):
    result.append(x+i)
    result.append(x-i)

result = list(set(result))
result.sort()
print(result)

Submission status: Wrong Answer

Solution code:
k,x = map(int,input().split())
a=[]
for i in range(x-k+1,k+x-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:
# -*- coding: <encoding name> -*-

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

Submission status: Wrong Answer

Solution code:
# -*- coding: <encoding name> -*-

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:
# -*- coding: <encoding name> -*-

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

l = list()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# ABC137B

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

kuro=[]
for i in range(x-n+1,x):
    kuro.append(i)
for i in range(x,n+x):
    kuro.append(i)
K=str(kuro)
print("".join(K))

Submission status: Wrong Answer

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

kuro=[]
for i in range(x-n+1,x):
    kuro.append(i)
for i in range(x,n+x):
    kuro.append(i)
print(kuro)

Submission status: Wrong Answer

Solution code:
k,x=map(int,input().split())
left=max(-10000,x-k+1)
right=min(10000,x+k-1)
#ans=right-left+1
#print(ans)
for i in range(left,right+1):
  print(i ,end="/n")

Submission status: Wrong Answer

Solution code:
k,x=map(int,input().split())
left=max(-10000,x-k+1)
right=min(10000,x+k-1)
ans=right-left+1
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(s)

Submission status: Wrong Answer

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

ans=X-K+1

print(ans,end="")

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

lis = [x]

for i in range(1,k):
    lis.append(x-1)
    lis.append(x+1)
new_list = sorted(lis)

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

Submission status: Wrong Answer

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

lis = [x]

for i in range(1,k):
    lis.append(x-1)
    lis.append(x+1)
new_list = sorted(lis)

print(*new_list)

Submission status: Wrong Answer

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

lis = [X]

for i in range(K-1):
    right = X + 1
    left  = X - 1
    lis.append(right)
    lis.append(left)

new_list = sorted(lis)

print(new_list)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

l = []
cnt = -(k-1)

for i in range(k+k-1):
    l.append(cnt)
    cnt+=1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
def main():
    K, X = map(int, input().split())
    LOWER = max(X - K + 1, -1000000)
    UPPER = min(X + K - 1, 1000000)
    print(LOWER)
    ans = [i for i in range(LOWER, UPPER+1)]
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Wrong Answer

Solution code:
K,X = map(int,input().split())
A = X - (K-1)
B = X + (K-1)
ans = []

for i in range(A,B+1):
    ans.append(i)

print(ans)

Submission status: Wrong Answer

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans=str("")
for n in nums:
    ans+=str(n)+" "
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(list(range(c,d)))

Submission status: Wrong Answer

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

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

print(list(range(c,d)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in (b-(a-1),b+(a-1)+1):
  print(i,' ',end='')

Submission status: Wrong Answer

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

c = []
for i in range(2*k-1):
    c.append(x-(k-1-i))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K,X = map(int, input().split())
a, b = 0,0
A = []
if X - K+1 < -1000000:
  a = -1000000
else:
  a = X - K+1

if X + K-1 > 1000000:
  b = 1000000
else:
  b = X + K-1

for _ in range(a,b+1):
  A.append(_)
  
print(A)

Submission status: Wrong Answer

Solution code:

K, X = map(int, input().split())
list_ans = []

for i in range(K):
    list_ans.append(X-(K-(i+1)))
 
for j in range(K-1):
    list_ans.append(X+j+1) 

print(list_ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
p,q= input().split()
a,b =(int(p), int(q))
list_np = np.arange(-1000000, 1000000,1)
ans_list = []
for i in range(a):
    ans_list.append(b + i)
    ans_list.append(b - i)
ans_list.pop(0)
ans_list.sort()
ans=''
print(ans_list)
for i in range(a*2 -1):
    if i < a * 2 -1 :
        ans += str(ans_list[i])
        ans +=' '
    else:
        ans +=str(ans_list[i])
        break
print(ans)

Submission status: Wrong Answer

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

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())
for i in range(X-K+1,X+K):
  print(i,end='')

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

Submission status: Wrong Answer

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

# 黒い石の可能性がある座標をリスト化
array = []
for i in range((K-1)*2+1):
    array.append(X-K+1+i)
    i += 1
ans = sorted(array)

print(*ans, sep="")

Submission status: Wrong Answer

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

# 黒い石の可能性がある座標をリスト化
array = []
i = 1
for i in range((K-1)*2+1):
    array.append(X-K+i)
    i += 1
ans = sorted(array)

print(*ans, sep="")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = ''
for i in range(max(0,X-K)+1,X+K):
  ans += str(i) + ' '

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K, X = [int(x) for x in 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())
print([x-k+1+i for i in range(2*k-1)])

Submission status: Wrong Answer

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

q = [j for j in p if j > -100000 and j < 1000000]

print(q)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = input()
arr = x.split(" ")
stones_num = int(arr[0])
stones_pos = int(arr[1])
cords = []
for i in range(stones_num):
    cords.append(stones_pos)
    stones_pos += 1
stones_pos = int(arr[1])
for i in range (stones_num):
    cords.append(stones_pos)
    stones_pos -= 1
cords.sort()
print(*list(dict.fromkeys(cords)) , sep = ' ')

Submission status: Wrong Answer

Solution code:
import math


def readints():
    return list(map(int, input().split()))


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

if k == 1:
    print(100)
    exit()

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

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
l=[]
for x in range(a):
    l.append(b-x)
    l.append(b+x)
l.remove(b)
print(sorted(l))

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
c=[]
import sys
if a==1:
  print(b)
  sys.exit()
for i in range(a*2-1):
  c+=str(b-a+i+1)

for i in range(a*2-1):
  print(c[i],end=" ")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
s1=set()
s2=set()
for i in range(n):
    s1.add(k-i)
for j in range(n):
    s2.add(k+j)
print(" ".join(map(str,s1|s2)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

mn = max(x - k+1, -20000)
mx = min(x + k-1, 20000)
res = [i for i in range(mn, mx+1)]
print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s = ""
first = X - K + 1
for i in range(K*2 - 1):
    s += str(first + i)
print(s)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
c=b-a
print(c+1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if x-k+1<=-1000000:
  a=-1000000
else: a=x-k+1
if x+k-1>=1000000:
  b=1000000
else:b=x+k-1

print([i for i in range(a,b+1)])

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
cnt = 1
while A*cnt-(cnt-1) < B:
  cnt +=1
print(cnt)

Submission status: Wrong Answer

Solution code:
#player1:1
#player2:2
#blank:0
k, m =map(int, input().split())
n = int(k / 2)
answer = [m]
for i in range(1, n + 2):
    answer.append(m - i)
    answer.append(m + i)
answer.sort()
if k == 1:
    answer = [m]
print(*answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k, m =map(int, input().split())
n = int(k / 2)
answer = [m]
for i in range(1, n + 2):
    answer.append(m - i)
    answer.append(m + i)
answer.sort()
print(*answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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 = list(map(int, input().split()))

Min = X - K + 1
Max = X + K - 1

ans = list(range(Min, Max+1))

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def fa(K,X):
    ch=""
    L=[X]
    for i in range(0,K):
        L.append(X-i)
        L.append(X+i)
    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(",",""))