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

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

print([i for i in range(l,r)])

Submission status: Wrong Answer

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

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):
    if -1000000 <= i <= 1000000:
        c.append(i)

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

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())
seq = []

for j in range(2):
	for i in range(k):
		buf = str(x + i * (-1) ** j)
		if buf not in seq:
			seq.append(buf)
		
seq.sort()
print(" ".join(seq))

Submission status: Wrong Answer

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

while True:
    print(ans2)
    ans2 = ans2 + 1
    if ans2 == ans1:
        break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K, X = map(int, input().split())
num = list(range(X - K + 1, K + X))
if X - K + 1 < -1000000:
    num = list(range(-1000000, K + X))
elif K + X > 1000000:
    num = list(range(X - K + 1, 1000000))

print(num)

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

Submission status: Wrong Answer

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

a-=1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

k = a[0]
x = a[1]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

t=[0]*(2*k-1)

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

Submission status: Wrong Answer

Solution code:
N,place=map(int,input().split())
#place-N+1~place+N-1を出力すればいい
for x in range(place-N+1,place+N-1):
  print(x,end=' ')

Submission status: Wrong Answer

Solution code:
N,place=map(int,input().split())
#place-N+1~place+N-1を出力すればいい
for x in range(place-N+1,place+N-1):
  print(x,end='')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-
K, X = map(int, input().split())
print(list(range(X-K+1, X+K)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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


start = x - k + 1
for i in range(2*k):
    if -1000001 < start+i < 1000001:
        print(start + i)

Submission status: Wrong Answer

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

k = il[0]
x = il[1]

minusLimit = x - k + 1
plusLimit = x + k - 1

i = minusLimit

s = ""

while minusLimit <= i <= plusLimit :
  s =  s + str(i) + " "
  i = i + 1
  print(s)
s[:-1]

Submission status: Wrong Answer

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

k = il[0]
x = il[1]

minusLimit = x - k + 1
plusLimit = x + k - 1

i = minusLimit

while minusLimit <= i <= plusLimit :
  s = str(i) + " "
  i = i + 1
s[:-1]
print(s)

Submission status: Wrong Answer

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

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:
def stones(input):
    k, x = map(int, input.split())
    if k is 1:
        print(x)
        return x
    j = [i for i in range(x - k + 1, x + k)]
    s = ' '.join(map(str, j))
    print(s)
    return
 
 
stones('3 7')

Submission status: Wrong Answer

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

low = X - K
hight = X + K

a = set()
for x in range(low + 1, hight, 1):
    a.add(x)
a = [str(x) for x in a]
print(' '.join(a))

Submission status: Wrong Answer

Solution code:
def stones(input):
    k, x = map(int, input.split())
    if k is 1:
        print(x)
        return x
    j = [i for i in range(x - k, x + k)]
    s = ' '.join(map(str, j))
    print(s)
    return s
 
 
stones(input())

Submission status: Wrong Answer

Solution code:
def stones(input):
    k, x = map(int, input.split())
    if k is 1:
        print(x)
        return x
    j = [i for i in range(x - k, x + k)]
    s = ' '.join(map(str, j))
    print(s)
    return
 
 
stones(input())

Submission status: Wrong Answer

Solution code:
K,X = map(int, input().split())
hajime=X-(K-1)
owari=X+(K-1)
if hajime<-1000000:
    hajime=-1000000
if owari>1000000:
    owari=1000000

kotae=tuple(range(hajime,owari+1))

print(kotae)

Submission status: Wrong Answer

Solution code:
K,X = map(int, input().split())
hajime=X-(K-1)
owari=X+(K-1)
if hajime<-1000000:
    hajime=-1000000
if owari>1000000:
    owari=1000000

kotae=list(range(hajime,owari+1))

print(kotae)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# −1000000 <= x <= 1000000

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

if MIN < -1000000:
    MIN = -1000000

if 1000001 < MAX:
    MAX = 1000001

for x in range(MIN, MAX):
    print(x, end=" ")

print('\b')

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
import sys
import math
import bisect
import atexit
import io
import heapq
from collections import defaultdict, Counter
MOD = int(1e9+7)



# n = map(int, raw_input().split())
# input = map(int, raw_input().split())
def main():
    k, x = map(int, raw_input().split())
    for i in range(-k+1, k):
        print x-i,



main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

num = end - start + 1 

anserLsit = []
for i in range(num):
  anserLsit.append(start+i)

print(anserLsit)

Submission status: Wrong Answer

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

#X +- (K-1)　を一列に出力する

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

Submission status: Wrong Answer

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

#X +- (K-1)　を一列に出力する

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

Submission status: Wrong Answer

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

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

lst = list(set(lst))

lst = ([i for i in lst if i  <= 1000000 and i >= -1000000])
print(' '.join(map(str,lst)))

Submission status: Wrong Answer

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

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

lst = list(set(lst))

print([i for i in lst if i  <= 1000000 and i >= -1000000])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    input_line = list(map(int,input().split()))
    A = range(input_line[1]-input_line[0]+1,input_line[1]+input_line[0],1)
    print(list(A))
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(" ".join(list(map(str,range(b-a+1,b+a-1)))))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
for i in range(2*a-1):
  print(b-a+1,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())
print (list(range(x-k+1,x+k-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:
# -*- coding: utf-8 -*-

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

# solve & output
if K > 1:
    for i in range(X - K + 1, X + K - 1):
        print(i, end=' ')
else:
    print(X)

Submission status: Wrong Answer

Solution code:
a, b = (int(i) for i in input().split()) 
s = b - (a-1)
e = b + (a-1)
lst = list(range(s, e+1))
print(lst)

Submission status: Wrong Answer

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

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:
# -*- coding: utf-8 -*-

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

Submission status: Wrong Answer

Solution code:
#input 2 integers K and X
K,X = (int(x) for x in input().split())

#define answer vaiable
print(list(range(X-(K-1), X+(K-1)+1 )))

Submission status: Wrong Answer

Solution code:
#input 2 integers K and X
K,X = (int(x) for x in input().split())

#define answer vaiable
print(list(range(X-(K-1), X+(K-1) )))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k,x=map(int,input().split())
if k>2:
  print(*range(x-k,x+k))
else:
  print(x)

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

a = input().split()

K = int(a[0])

X = int(a[1])

b = []

for i in range(2 * K -1) :
	b.append(X - (K - 1 - i))
	print(b[0], ' ', )

Submission status: Wrong Answer

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

a = k - 1
b = a * 2

if a == 0:
	print(x)
else:
    for i in  list(range(a,b)):
        print(i,end=" ")

Submission status: Wrong Answer

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


if a == 0:
	print(x)
else:
    for i in  list(range(a,b)):
        print(i)

Submission status: Wrong Answer

Solution code:
a = []

a = input().split()

K = int(a[0])

X = int(a[1])

b = []

for i in range(2 * K -1) :
	b.append(X - (K - 1 - i))
	print(b[0], ' ')

Submission status: Wrong Answer

Solution code:
a = []

a = input().split()

K = int(a[0])

X = int(a[1])

b = []

for i in range(2 * K -1) :
	b.append(X - (K - 1 - i)) 

print(b[i] for i in range(2 * K -1) )

Submission status: Wrong Answer

Solution code:
n = list(map(int, input().split()))
k = n[0]
x = n[1]
s1 = x - k + 1
s2 = x + k - 1
print(list(range( (s1), (s2 + 1)  )))

Submission status: Wrong Answer

Solution code:
n = list(map(int, input().split()))
k = n[0]
x = n[1]
s1 = n[1] - n[0] - 1
s2 = n[1] + n[0] - 1
print(list(range( (s1), (s2 + 1)  )))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
k, x = map(int, input().split())

# 文字列の入力
ans = list(range(x-k+1,x+k,1)) 

# 出力
print(ans)

Submission status: Wrong Answer

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

ans=[x]
for i in range(1,k):
    ans.insert(0,x-i)
    ans.append(x+i)
    
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:
import numpy as np

K, X = map(int, input().split())
Ans = np.arange(X-K+1, X+K)
print(Ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

#sys.stdin = open("first.txt","r")

def main():
	a, b = map(int, raw_input().split())
	print max([a + b, a - b,a * b])

raw_input = sys.stdin.readline

if __name__ == '__main__':
	#for j in xrange(int(raw_input())):
	main()

Submission status: Wrong Answer

Solution code:
k, x = [int(x) for x in input().split()]
if k == 1:print(x)
else:
    begin = x - (k//2) - 1
    ends  = x + (k // 2) + 1
    print(*list(range(begin, ends+1)))

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

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

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

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())
black = list(range(x-k+1, x+k))
print(black)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(x-k+1, x+k-1):
    if -n < i and i < n:
        print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a= map

Submission status: Wrong Answer

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

minx = max([x-k+1, -1000000])
maxx = min([x+k-1, +1000000])

print (minx)
print (maxx)

i = minx
while i <= maxx:
    print (i)
    i += 1

Submission status: Wrong Answer

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

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

print(result)

Submission status: Wrong Answer

Solution code:
import numpy as np
i = list(map(int, input().split()))
print(np.arange(i[0] - i[1] + 1, i[0] + i[1]))

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

t=" ".join([str(v) for v in range(-k+1,k)])
print(t)

Submission status: Wrong Answer

Solution code:
K,X = map(int,input().split())
if K == 1:
    print(X)
checkpoint = X
result = set()
start = checkpoint - K + 1
for i in range(K):
    for i in range(K):
        result.add(start + i)
    start = start + 1
result = sorted(result)
L=[str(a) for a in result]
L=" ".join(L)
print(L)

Submission status: Wrong Answer

Solution code:
import numpy as np
firstline=input().split()
K=int(firstline[0])
X=int(firstline[1])
np.arange(X-K+1,X+K)

Submission status: Wrong Answer

Solution code:
K,X = map(int,input().split())
if K == 1:
    print(X)
checkpoint = X
result = set()
start = checkpoint - K + 1
for i in range(K):
    for i in range(K):
        result.add(start + i)
    start = start + 1
L=[str(a) for a in result]
L=" ".join(L)
print(L)

Submission status: Wrong Answer

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

k = int[0]
x = int[1]

p=x + 1 
q=p - k
r=x + k
print(list(range(q,r)))

Submission status: Wrong Answer

Solution code:
K,X = map(int,input().split())
if K == 1:
    print(X)
checkpoint = X
result = set()
start = checkpoint - K + 1
for i in range(K):
    for i in range(K):
        result.add(start + i)
    start = start + 1
print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

k = int[0]
x = int[1]


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

Submission status: Wrong Answer

Solution code:
K,X = map(int,input().split())
if K == 1:
    print(X)
checkpoint = X
result = set()
start = checkpoint - K + 1
for i in range(K):
    for i in range(K):
        print(start + i)
        result.add(start + i)
    start = start + 1
print(result)

Submission status: Wrong Answer

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

for i in range(K):
    ans.append(X-i)
    
for i in range(K):
    ans.append(X+i)
    
ans.sort()
ans.remove(X)
print(ans)

Submission status: Wrong Answer

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

k = int[0]
x = int[1]

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

Submission status: Wrong Answer

Solution code:
import sys
import re
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

K,X = MULT_INT_LIST()
ans = []
kuro_min = X-K+1
kuro_max = X+K-1
for i in range(kuro_min,kuro_max):
    ans.append(i)
ans = str(ans)
ans = ans.replace(",", "")
ans = ans.strip('[]') 
print(ans)

Submission status: Wrong Answer

Solution code:
k,x= map(int, input().split())
#-10000, 10000の制約に注意して
#x-k+1から始まってx+k-1で終わる
number = []
number.append(x)
for i in range(1,k):
    number.append(x+i)
    number.append(x-i)
number.sort()
for m in number:
    if m >1000000 or m<-1000000:
        number.pop(m)
print(number)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
input_num=input().split()# 2 4のような入力
input_num=[int(num) for num in input_num]#intへ変換

K=input_num[0]#連続する数
X=input_num[1]#確実に黒い

min_cons=-10**6
max_cons=10**6

max_num=X+K-1
min_num=X-(K-1)

if min_num<min_cons:
    min_num=min_cons

if max_num>max_cons:
    max_num=max_cons

num_list=[i for i in range(min_num,max_num+1)]

print(num_list)

Submission status: Wrong Answer

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

k = int[0]
x = int[1]

p = range(x + 1 - k,x + k)

print(list(p))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

k = int[0]
x = int[1]

p = range((x + 1) - k,x + k)

print(p)

Submission status: Wrong Answer

Solution code:
i = list(map(int,input().split()))
K = i[0]
X = i[1]
print(range(X-K+1,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 = (int(i) for i in input().split())

arr = []

for i in range(-k + 1, 0):
  for j in range(0, k + 1):
    arr.append(i + j + x) 

sorted_list = sorted(list(set(arr)))
if (k == 1):
  result = x

result =  " ".join(map(str, sorted_list))

print(result)

Submission status: Wrong Answer

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

a.remove(X)
a.sort(reverse=False)
print(a)

Submission status: Wrong Answer

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

a=int[0]
b=int[1]

x=range((b+1)-a,b+a)

print(x)

Submission status: Wrong Answer

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

arr = []

for i in range(-k + 1, 0):
  for j in range(0, k + 1):
    arr.append(i + j + x) 

result = sorted(list(set(arr)))

if (k == 1):
  result = x

print(result)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
mylist = []
for row in range(a):
  c = row+b
  mylist.append(c)
for row in range(a):
  c = -row+b
  mylist.append(c) 
mylist = sorted(set(mylist))
for row in mylist:
	print(row,end='')

Submission status: Wrong Answer

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

a=int[0]
b=int[1]

x=range((b+1)-a,(b-1)+a)

print(x)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
from __future__ import print_function

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

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

Submission status: Wrong Answer

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

ans = []
a = x - k + 1


for i in range(0, 1+(k-1)*2):
  ans.append(a+i)


print(ans)

Submission status: Wrong Answer

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

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

print(output)

Submission status: Wrong Answer

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

c = a - 1
l = range(b - c , b * 2 - c)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

K = S[0]
X = S[1]


A = abs(X-K)+1
B = X+K

for i in range(A, B, 1):
  print(i, end="")
  print(" ", end="")

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
from __future__ import print_function

k = 4
x = 0

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

Submission status: Wrong Answer

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

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:
  for a in range(len(l)):
    print(l[a],end=" ")

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 = 2 * k - 2
ls = []
for i in range(a, x + b):
    print(i, end=" ")

Submission status: Wrong Answer

Solution code:
import numpy as np

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

ans = np.zeros(2*K-1)
for k in range(2*K-1):
  ans[k] = X - (K - 1) + k

np.set_printoptions(threshold=np.inf)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

list = []
if K != 1:
  for i in range(min, max + 1):
    list.append(i)
else:
  print(X)
for i in list:
  print(i)

Submission status: Wrong Answer

Solution code:
def main():
    l = input().split()
    k, x = int(l[0]), int(l[1])
    min_x = x - k + 1
    max_x = k + x - 1
    print(list(range(min_x, max_x+1)))
    
if __name__=="__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
i = list(map(int, input().split()))
K = i[0]
X = i[1]
start_point = X - K+1
end_point = X + K
result = np.arange(start_point, end_point)
print(result)

Submission status: Wrong Answer

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

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

list = []
if K != 1:
  for i in range(min, max + 1):
    list.append(i)
else:
  print(X)
for i in list:
  print(i)

Submission status: Wrong Answer

Solution code:
firstline=input().split()
K=int(firstline[0])
X=int(firstline[1])
print(X-(K-1),X-(K-2),...,X,...,X-(K-2),X-(K-1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
i = list(map(int, input().split()))
K = i[0]
X = i[1]
start_point = X - K+1
end_point = X + K - 1

result = np.linspace(start_point, end_point)
print(result)

Submission status: Wrong Answer

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

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

list = []
if K != 1:
  for i in range(min, max + 1):
    list.append(i)
else:
  print(X)
for i in list:
  print(i)

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)

r = ""
for item in set(ans):
    r += str(item)+" "

print(r)

Submission status: Wrong Answer

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

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(str(i))
    
  for j in range(X - K + 1 , X):
    arr.append(str(j))
    
arr.sort()
result = " ".join(arr)
print(result)

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(", ".join(repr(e) for e in ans))

Submission status: Wrong Answer

Solution code:
K,X=[int(item) for item in input().split()]
first=max(-1000000,X-K+1)
last=min(1000000,X+K-1)
print(last-first+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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