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:
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    K,X = mi()
    Z = list(range(2000001))

    x = X
    ans = set()
    for i in range(K):
        y1 = x + i 
        y2 = x - i

        for y in [y1,y2]:
            y += 1000000
            if 0<= y < len(Z):
                ans.add(y-1000000)

    ans = list(ans)
    ans.sort()

    print(*ans,sep=" ")





if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    K, X = LI()

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def main():
    input = sys.stdin.buffer.readline
    k, x = map(int, input().split())
    ans = [i for i in range(x - k + 1, x + k)]
    print(*ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

xmin = X - K + 1
xmax = X + K - 1
a = []

for i in range(xmin, xmax+1):
  a.append(i)

map = map(str, a)

print(' '.join(map))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
r=input().split()
K=int(r[0])
X=int(r[1])
S=""
for i in range(2*K-1):
    ans=X-K+i+1
    if -1000000<=ans<=1000000:
        S+=str(ans)+" "
print(S.rstrip())

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    K, X = map(int, readline().split())
    res = [x for x in range(X - K + 1, X + K)]
    print(*res)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

range1=(x-k)+1
range2=(x+k)-1

for i in range(range1,range2+1):
    print(i,end=' ')

Submission status: Accepted

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

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

l = l[::-1]
for i in l:
    print(i,end=" ")

Submission status: Accepted

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

k_min=x-k+1
k_max=x+k-1

k_list=[str(i) for i in range(k_min, k_max+1)]

print(" ".join(k_list))

Submission status: Accepted

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

    left = x - k + 1
    right = x + k - 1

    for i in range(left, right + 1):
        print(i, end=" ")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

    left = max(x - k + 1, -1000000)
    right = min(x + k - 1, 1000000)

    for i in range(left, right + 1):
        print(i, end=" ")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(1, k):
    a.append(x - i)
    a.append(x + i)
a.sort()
print(*a)

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())
candidatetop = min(X+K-1,1000000)
candidatedown = max(X-K+1,-1000000)
nums = [i for i in range(candidatedown,candidatetop+1)]
print(' '.join(map(str,nums)))

Submission status: Accepted

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

Submission status: Accepted

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

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

ans = []

for i in range(l,r+1):
    ans.append(str(i))

ans = " ".join(ans)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
out = lambda x: print('\n'.join(map(str, x)))

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

Submission status: Accepted

Solution code:
def mapt(fn, *args):
    return tuple(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))


def main():
    k, x = Input()
    return " ".join(map(str, list(range(x-(k-1), x+k))))


print(main())

Submission status: Accepted

Solution code:

# ABC138
# B One Clue
# K個連続黒、Xが黒、座標-1000000+1000000
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)
I = set(L)
L = list(sorted(I))
for s in L:
    print(s,end = " ")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 問題：https://atcoder.jp/contests/abc137/tasks/abc137_b

k, x = map(int, input().strip().split())
res = [i for i in range(x - k + 1, x + k)]
res_str = ' '.join(map(str, res))
print(res_str)

Submission status: Accepted

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

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

Submission status: Accepted

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)]
elif maxx - (k-1) < x:
    l = [i for i in range(maxx-x,maxx+1,-1)]
else:
    l = [i for i in range(x-(k-1),x+(k-1)+1)]

print(" ".join([str(s) for s in l]))

Submission status: Accepted

Solution code:
k,x=map(int,input().split())
mi=max(-1000000,x-k+1)
ma=min(1000000,x+k-1)
a=[]
for i in range(0,ma-mi+1):
    a.append(i+mi)
print(*a)

Submission status: Accepted

Solution code:
K, X = map(int, 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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k,x = map(int,input().split())
start = x - k + 1
end = x + k - 1
ans = ''
for i in range(start,end+1):
    ans += str(i) + ' '
print(ans[:len(ans)-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())

min_x = max(X-(K-1), -1000000)
max_x = min(X+(K-1), 1000000)

ans = list(range(min_x, max_x+1))

print(*ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
K, X = list(map(int,input().rstrip().split()))
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(-(K-1),K-1) :
    ans += str(X+i) + ' '

ans += str(X+(K-1))
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

k,x=mp()
m=max(-1000000,x-(k-1))
M=min(1000000,x+k-1)
print(*[i for i in range(m,M+1)])

Submission status: Accepted

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

if K == 1:
    print(X)
else:
    ans = list(range(X-(K-1), X+K))
    print(" ".join(map(str,ans)))

Submission status: Accepted

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

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

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

res = " ".join(A)
print(res)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))

k,x=nii()

left=max(-1000000,x-k+1)
right=min(1000000,x+k-1)

ans=[i for i in range(left,right+1)]
print(*ans)

Submission status: Accepted

Solution code:
# p = list(map(int, input().split()))
# a, b, c = map(int, input().split())
# n = int(input())
# s = input()

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 = [i for i in range(X-K+1, X+K)]
print(*ans)

Submission status: Accepted

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

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())
print(" ".join(list(map(str, list(range(x-k+1, x+k))))))

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

K, X = mapint()
print(*range(max(-10000000, X-K+1), min(10000001, X+K)))

Submission status: Accepted

Solution code:
import sys

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

left = max(-1000000, X - K + 1)
right = min(1000000, X + K - 1)
# print(left, right)
ans = [i for i in range(left, right+1)]
print(*ans)

Submission status: Accepted

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

print(*sorted(list(ans)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import collections
import fractions
import itertools
import functools
import operator
import bisect

def solve():
    k, x = map(int, input().split())
    ans = []
    for i in range(max(-1000000, x-k+1), min(1000000, x+k)):
        ans.append(str(i))
    print(" ".join(ans))
    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for n in range(X-K+1,X+K):
  A.append(n)

print(*A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

X_min = X - K + 1
X_max = X + K

print(*list(range(X_min,X_max)))

Submission status: Accepted

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

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

    r = [str(x) for x in res]
    print(" ".join(r))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp=list(map(int,input().split()))
k=inp[0]
x=inp[1]
a=max(x-k+1,-1*pow(10,6))
b=min(x+k-1,pow(10,6))
for i in range(a,b+1):
  print (i,end=" ")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
lines = [s.rstrip("\n") for s in sys.stdin.readlines()]
k, x = [int(num) for num in lines.pop(0).split(" ")]
lis = [str(n) for n in range(x - k + 1, x + k)]
print(" ".join(lis))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations,product#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def binr(x): return bin(x)[2:]
def bitcount(x): #xは64bit整数
    x= x - ((x >> 1) & 0x5555555555555555)
    x= (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x= (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f 
    x+= (x >> 8); x+= (x >> 16); x+= (x >> 32) 
    return x & 0x7f

def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reverse=True)  #二個目の要素で降順並び替え

    #N = int(input())
    K,X = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列

    l=[i for i in range(max(X-K+1,-1000000),min(1000000,X+K-1)+1)]
    print(*l)



if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in l:
  print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a = []
for i in range(k):
  a.append(x-i)
for i in range(k-1):
  a.append(x+1+i)
a.sort()
res = ''
for i in range(len(a)):
  res += str(a[i])
  if i != len(a)-1:
    res += (' ')
  
print(res)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))

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

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

Submission status: Accepted

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

k,x=input2()

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

print(*ans)

Submission status: Accepted

Solution code:
A=list(map(int,input().split()))
k=A[0]
x=A[1]
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())

mi = min(1000000, x - k + 1)
ma = max(-1000000, x + k - 1)

for i in range(mi, ma+1):
    print(i)

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())
n = k - 1
data = []
for i in range(1, n+1):
    data.append( x - i )
data.append(x)
for i in range(1, n+1):
    data.append( x + i )

data.sort()

print(*data)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans=[K]

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

ans.sort()


print(*ans)

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(*a)

Submission status: Accepted

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

Submission status: Accepted

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

ma = max(-1000000, x- k + 1)
mi = min(1000000, x + k -1)

for i in range(ma, mi+ 1):
    print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# abc137_b.py
# https://atcoder.jp/contests/abc137/tasks/abc137_b

# B - One Clue /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 200点

# 問題文
# 数直線上に 2000001個の石が置かれています。
# これらの石の座標は −1000000,−999999,−999998,…,999999,1000000です。
# これらの石のうち、ある連続する K個の石が黒で塗られており、それ以外の石は白で塗られています。
# また、座標 Xにある石は黒で塗られていることが分かっています。
# 黒で塗られている石が置かれている可能性のある座標をすべて、小さい順に出力してください。

# 制約
#     1≤K≤100
#     0≤X≤100
#     入力中の値はすべて整数である。

# 入力
# 入力は以下の形式で標準入力から与えられる。
# K X

# 出力
# 黒で塗られている石が置かれている可能性のある座標をすべて、空白で区切って小さい順に出力せよ。

# 入力例 1
# 3 7

# 出力例 1
# 5 6 7 8 9

# 黒で塗られた石の数が 3個であることと、座標 7 の石が黒で塗られていることが分かっています。このとき、次の 3通りの可能性が考えられます。

#     黒で塗られた 3個の石は座標 5,6,7に置かれている。
#     黒で塗られた 3個の石は座標 6,7,8に置かれている。
#     黒で塗られた 3個の石は座標 7,8,9に置かれている。

# よって、黒で塗られている石が置かれている可能性のある座標は 5,6,7,8,9の 5つです。

# 入力例 2
# 4 0

# 出力例 2
# -3 -2 -1 0 1 2 3

# 負の座標に黒で塗られている石が置かれている可能性もあります。

# 入力例 3
# 1 100

# 出力例 3
# 100


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    # N = int(lines[0])
    K, X = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(6):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(M):
    #     valueses.append(list(map(int, lines[i+1].split())))

    n = X - (K-1)

    results = list()
    for i in range(K*2-1):
        results.append(str(n+i))

    return [' '.join(results)]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['3 7']
        lines_export = ['5 6 7 8 9']
    if pattern == 2:
        lines_input = ['4 0']
        lines_export = ['-3 -2 -1 0 1 2 3']
    if pattern == 3:
        lines_input = ['1 100']
        lines_export = ['100']
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

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(str(i))
    
print(' '.join(list))

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for _ in range(K-1):
    ans_p+=1
    ans_n-=1

print(*[x for x in range(ans_n,ans_p+1)])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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