Problem:


Score : 200 points

Problem Statement

There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000.

Among them, some K consecutive stones are painted black, and the others are painted white.

Additionally, we know that the stone at coordinate X is painted black.

Print all coordinates that potentially contain a stone painted black, in ascending order.

Constraints

1 \leq K \leq 100

0 \leq X \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

K X

Output

Print all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.

Sample Input 1

3 7

Sample Output 1

5 6 7 8 9

We know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:

The three stones painted black are placed at coordinates 5, 6, and 7.

The three stones painted black are placed at coordinates 6, 7, and 8.

The three stones painted black are placed at coordinates 7, 8, and 9.

Thus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.

Sample Input 2

4 0

Sample Output 2

-3 -2 -1 0 1 2 3

Negative coordinates can also contain a stone painted black.

Sample Input 3

1 100

Sample Output 3

100



Sample input:
3 7


Sample output:
5 6 7 8 9

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(K: int, X: int):
    n = K * 2 - 1
    ret = []
    x = X - K + 1
    for i in range(n):
        ret.append(x + i)
    print(' '.join([str(r) for r in ret]))
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  # type: int
    X = int(next(tokens))  # type: int
    solve(K, X)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A,B = [int(zz) for zz in input().split()]

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

Submission status: Accepted

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

print(' '.join([str(i) for i in range(X-K+1, X+K)]))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

(A,B) = (int(i) for i in input().split(" "))
print(" ".join([str(i) for i in range(B-A+1,B+A)]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

k, x = na()
y = max(-1000000, x-k+1)
z = min(1000000, x+k-1)
for u in range(y, z+1):
    sys.stdout.write(str(u) + " ")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for k in range(X - K + 1, X + K):
    print("{} ".format(k), end="")

print("")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

K, X = map(int, input().split())
mn = max(X - K + 1, -1000000)
mx = min(X + K - 1, 1000000)
print(*range(mn, mx + 1, 1))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

from collections import deque
import itertools as ite
import sys
import math

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
from functools import reduce
import sys
import math
import bisect
import random
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return list(map(float, sys.stdin.readline().split()))
def LS():return sys.stdin.readline().split()
def SR(n): return [list(sys.stdin.readline())[:-1] for i in range(n)]
def IR(n): return [int(sys.stdin.readline()) for i in range(n)]
def LIR(n): return [list(map(int, sys.stdin.readline().split())) for i in range(n)]
def LSR(n): return [list(map(list, sys.stdin.readline().split())) for i in range(n)]
_gcd = lambda x, y: _gcd(y, x%y) if (x%y) else y
_lcm = lambda x, y: x*y // _gcd(x, y)
def gcd(*numbers):
    return reduce(_gcd, numbers)
def lcm(*numbers):
    return reduce(_lcm, numbers)
sys.setrecursionlimit(1000000)
INF = float('inf')
mod = 1000000007
dire4 = [(1,0), (0,1), (-1,0), (0,-1)]
dire8 = [(1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1)]

K, X = LI()

print(*[i for i in range(X-K+1, X+K)])

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

print(ans[1:])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def solve(K: int, X: int):
    left = X-K+1
    right = X+K-1
    print(" ".join(map(str, range(left, right+1))))
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  # type: int
    X = int(next(tokens))  # type: int
    solve(K, X)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

ans = ' '.join(
    str(i)
    for i in range(X - K + 1, X + K)
)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意

a,b = [int(i) for i in readline().split()]


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

print(*ans)

Submission status: Accepted

Solution code:
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7

K, X = list(map(int, sys.stdin.readline().split()))

l = max(-1000000, X - K + 1)
r = min(1000000, X + K - 1)

print(*range(l, r + 1))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(K: int, X: int):
    print(*range(X-K+1, X+K))

    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  # type: int
    X = int(next(tokens))  # type: int
    solve(K, X)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res

def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    a,b = LI()
    print(max(a+b,a-b,a*b))
    return

#B
def B():
    k,x = LI()
    ans = []
    for i in range(x-k+1,x+k):
        ans.append(i)
    print(*ans)
    return

#C
def C():

    return

#D
def D():

    return

#E
def E():

    return

#F
def F():

    return

#Solve
if __name__ == "__main__":
    B()

Submission status: Accepted

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

ans = []

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

print(*ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)

def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))
import math

k, x = getList()
print(*range(x - k + 1, x + k))

Submission status: Accepted

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

import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
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)
I = set(L)
for s in I:
    print(s,end = "")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for i in range(max(-1000000,X-K+1), min(X+K,1000000):
    print(i, end=' ')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b = rm()
print(*list(range(b-a+1:b+a)))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N, X=map(int, input().split())
ans=[]
for _ in range(X-N+1, X+N):
  ans.append(_)
print(" ".join(ans))

Submission status: Runtime Error

Solution code:



def fun(n,num,count):

    if count == (num*2)-1:
        return
    print(n,end=" ")
    count +=1
    fun(n+1,num,count)
xnum=list(map(int,input().split()))
x=xnum[0]
num=snum[1]

m=x-(num-1)

fun(m,num,0)

Submission status: Runtime Error

Solution code:
def fun(n,num,count):

    if count == (num*2)-1:
        return
    print(n,end=" ")
    count +=1
    fun(n+1,num,count)
x=int(input())
num=int(input())
m=x-(num-1)

fun(m,num,0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
k, x = [int(x) for x in input().split()]
rl = max(-1000000, x - k + 1)
rr = min(+1000000, x + k - 1)
print(" ".join(range(rl, rr + 1)))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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="\t")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

lis = [x]
x_1 = x
x_2 = x

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

print(" ".join(new_list))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
k,x = map(int,input().split())
a = x+k-1
b = x-k+1
l = rane[b:a+1]
print(l)

Submission status: Runtime Error

Solution code:
Not found

Submission status: Runtime Error

Solution code:
import io

nim,mike=map(int,input().split())
for i in range(mike-nim+1,b+nim):
    print(i)

Submission status: Runtime Error

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

ans = [X]

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

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

ans.reverse()
print("".join(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

# This is the most optimal code as Coder I believe.
K, X = map(int, input().split())
l = max(-1000000, x - k + 1)
r = min(1000000, x + k - 1)
for i in range(l, r + 1):
    print(i)

# The official answer is as below.
# https://img.atcoder.jp/abc137/editorial.pdf

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(*C, '')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

print(*lis)

Submission status: Runtime Error

Solution code:
k = int(input())
x = int(input())

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

Submission status: Runtime Error

Solution code:
,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: Runtime Error

Solution code:
,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: Runtime Error

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: Runtime Error

Solution code:
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: Runtime Error

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

Submission status: Runtime Error

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

tmp = X + K
tmp2 = X - K + 1

ans = np.arange(tmp2, tmp)
for i, v in enumerate(ans):
    print(f' {v}', end='') if i > 0 else print(f'{v}', end='')
print('')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

print(" ".join(list(range(X - K, X + K + 1))))

Submission status: Runtime Error

Solution code:
"use strict";
main(require("fs").readFileSync("/dev/stdin", "UTF-8"));

function main(input) {
  input = input
    .split("\n")[0]
    .split(" ")
    .map(n => Number(n));

  const area = input[0];
  const base = input[1];

  let array = [];

  for (let i = base - (area - 1); i < base + area; i++) {
    array.push(i);
  }

  console.log(array.join(" "));
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

start = x - k+1
end = x + k-1

ans = ''
for i in range(start,end+1):
    ans += f'{i} '
ans = ans[:-1]

print(ans)

Submission status: Runtime Error

Solution code:
import java.util.Scanner;

public class Main<i> {
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        int k = sc.nextInt();
        int x = sc.nextInt();
        int s = x - (k - 1);
        int e = x + (k - 1);

        for (int i = s; i <= e; i++) {
            System.out.println(i);
        }
    }
}

Submission status: Runtime Error

Solution code:
ko,x=map(int,input().split())
s=max(x-ko+1,-1000000)
while True:
  print(s,end=" ")
  s+=1
  if s>min(ko+k-1,1000000):break

Submission status: Runtime Error

Solution code:
ko,x=map(int,input().split())
s=max(x-ko+1,-1000000)
while True:
  print(s,end==" ")
  s+=1
  if s>min(ko+k-1,1000000):break

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
int main(){
    long long K,X;cin >> K >> X;
    cout << X - (K - 1);
    for(int i = X-(K-2);i < X+K;i++) cout << " " << i;
    cout << endl;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

lis = [i for i in range(X-K+1,X+K)]
print(' '.join(map(str,r)))

Submission status: Runtime Error

Solution code:
k, x = map(int, input())
sa = k-1
zahyous = []
for add in range(-sa, sa+1):
  zahyous.append(str(x + sa))
ret_val = " ".join(zahyous)
print(ret_val)

Submission status: Runtime Error

Solution code:
k, x = map(int, input())
sa = k-1
zahyous = []
for add in range(-sa, sa+1):
  zahyous.append(str(x + sa))
ret_val = " ".join(zahyous)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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