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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# -*- coding utf-8 -*-
MOD = 10 ** 9 + 7

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

ans = (str(x) for x in range(X - K + 1, X + K) if -1000000 <= x <= 1000000)

print(' '.join(ans))

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())
for i in range(X-K+1,X+K):
    print(str(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())
print(' '.join(map(str, 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:
K,X=map(int,input().split())
for i in range(X+1-K,X+K):
    print(i,end=" ")

Submission status: Accepted

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

min_val = X-K+1
max_val = K+X-1

min_val = -1000000 if min_val < -1000000 else min_val
max_val = +1000000 if max_val > +1000000 else max_val

for val in range(min_val, max_val+1):
	if val == max_val:
		print(val)
	else:
		print(val, end=' ')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
K,X = [int(i) for i in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k, x = map(int, input().split())
k_min = max([-1000000,x-k+1])
k_max = min([1000000,x+k-1])

ans = ' '.join([str(i) for i in range(k_min,k_max+1)])
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin
# import numpy as np
# import sys
# sys.setrecursionlimit(10**4)

def _li(): return list(map(int, stdin.readline().split()))
def _li_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def _lf(): return list(map(float, stdin.readline().split()))
def _ls(): return stdin.readline().split()
def _i(): return int(stdin.readline())
def _f(): return float(stdin.readline())
def _s(): return stdin.readline()[:-1]


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

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())
print(" ".join([str(x-k+i) for i in range(1, 2*k)]))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(k-n+1,n+k):
    l.append(str(i))
    
print(' '.join(l))

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

K, X = MAP()

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

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())
c = []
for i in range(b-a+1,b+a):
  c.append(i)
print(*c)

Submission status: Accepted

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

myans = []

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

print(*myans)

Submission status: Accepted

Solution code:
a,b=map(int,input().split(' '))
c=[]
for i in range(a):
    c.append(b-i)
for i in range(a):
    c.append(b+i)
m=set(c)
m=list(m)
m.sort()
for i in m:
    print(i,end=' ')

Submission status: Accepted

Solution code:
#One Clue
# input

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

r = []

if x - k + 1 > -1000000:
    if x + k -1 < 1000000:
        r = range(x - k + 1, x + k)
    else:
        r = range(x - k + 1, 1000001)
else:
    r = range(-1000000, x + k)

s = ""

for c in r:
    s += str(c)
    s += " "

print(s[:-1])

Submission status: Accepted

Solution code:
n=list(map(int,input().split()))#k=n[0],x=n[1]
#print(n)
b = [n[1]]
for i in range(1, n[0]):
    b.append(n[1] + i)
    b.append(n[1] - i)
b=sorted(b)
#print(b)
for i in b:
    print(i,end=" ")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

ans.sort()
print(*list(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k,x=map(int,input().split())
start,end=max(-1000000,x-(k-1)),min(1000000,x+(k-1))
r=range(start,end+1)
print(*r,sep=' ')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

min = min if min >= -1000000 else -1000000
max = max if max <= 1000000 else 1000000

print(*range(min, max + 1))

Submission status: Accepted

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

out = str(X)

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

  
print(out)

Submission status: Accepted

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

a = X - K + 1
b = X + K - 1

d = [str(i) for i in range(a, b+1)]

c = ' '.join(d)
print(c)

Submission status: Accepted

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

for i in range (Xmin,Xmax+1):
    print (i," ",end ="")

Submission status: Accepted

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

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

print(" ".join(ans))

Submission status: Accepted

Solution code:
#KyoproRの競技プログラミング過去問配信
K,X = map(int,input().split())
k = []
for i in range(X-K+1,X+K):
    print(i,end = " ")

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:
# ABC137 B

import numpy as np

def resolve():
    k, x = map(int, input().split())
    for i in range(x-k+1, x+k):
        if -1000000 <= i and i <= 1000000:
            print("{} ".format(i), end="")
    print("")


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k, x = map(int, input().split())
hako = []
for stone in range(-k + x + 1, k + x):
  hako.append(str(stone))
if len(hako) == 0:
  hako.append(x)
print(" ".join(hako))

Submission status: Accepted

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

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

Submission status: Accepted

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

import sys, os
def ac_input(*args):
    return map(int, input().split())


def main():
    k, x = ac_input()
    for i in range(k*2-1):
        print(str(x-k+i+1)+" ", end="")
    print("")
if __name__ == "__main__" :
    main()

Submission status: Accepted

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

k = innum[0]
x = innum[1]

minim = int(max((x - k + 1), (-1000000)))
maxim = int(min((x + k - 1), 1000000))

result = ""

for i in range(minim, maxim + 1):
    result = result + " " + str(i)
print (result)

Submission status: Accepted

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

Submission status: Accepted

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

list = []

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(*list)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

if __name__ == "__main__":
    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())
L = [str(i) for i in range(x-k+1, x+k)]
print(' '. join(L))

Submission status: Accepted

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

up = x+k-1
down = x-k+1

if down < -1000000 : 
    down = -1000000
if up > 1000000 : 
    up = 1000000

for i in range(down, up+1, 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())
max=X+K-1
min=X-K+1
print(' '.join([str(a) for a in range(min,max+1)]))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# B - One Clue
def main():
  K, X = map(int, input().split(' '))
  print(*(range((X + 1) - K, (X + K))))

if __name__ == "__main__":
    main()

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())
# k, x = 4, 0

if __name__ == '__main__':
    print(' '.join(map(str, range(x - (k - 1), x + k))))

Submission status: Accepted

Solution code:
k, x = map(int, input().split())
n = x - k + 1
m = x + k 
ans = []
for i in range(n, m):
    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)

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

Submission status: Accepted

Solution code:
#B - One Clue(ABC137)
X=list(map(int, input().split()))
A=X[1]+(X[0]-1)
B=X[1]-(X[0]-1)
for i in range(B,A+1):
    print(i,end=" ")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def calc(a,b):
  return [a+b, a-b, a*b]

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = ' '.join(lis)
print(s)

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

Submission status: Accepted

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

# xにしか黒がない場合
if k == 1:
    print(x)
# 黒が複数いる場合
else:
    start = x - (k - 1)
    finish = x + k
    ans = []

    for i in range(start, finish):
        ans.append(i)

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

Submission status: Accepted

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

Const = 1000000

print( *[x + b for x in range(-(a-1),a) if abs(x + b) <= Const] )

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:
K, X = list(map(int, input().split()))
minimum = max(-1000000, X - (K - 1))
maximum = min(X + (K - 1), 1000000)
print(' '.join(map(str, range(minimum, maximum + 1))))

Submission status: Accepted

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

for k in reversed(range(K)):
  print(X - k)

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

Submission status: Accepted

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

Lists = [int(i) for i in range(a,b)]

for i in Lists:
    print(i)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
k,x = map(int,input().split())
k-=1
l=[i for i in range(-1000000,1000001) if (x-k <= i) and (i <= x+k)]
for j in l:
  print(j,end=' ')

Submission status: Accepted

Solution code:
#abc137b

k,x=map(int,raw_input().split())
for i in xrange(x-k+1,x+k-1):
 print i,
print x+k-1

Submission status: Accepted

Solution code:
#B - One Clue

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

leftbound= max(X-K+1,-10000)
rightbound=min(X+K-1 ,10000)

ml = [i for i in range(leftbound,rightbound+1)]

print(*ml)

Submission status: Accepted

Solution code:
result = input().split()
reslut_list = []
n1, n2 = int(result[0]), int(result[1])
min_coordinate = n2 - n1 + 1
max_coordinate = n1 + n2 
for i in range(min_coordinate, max_coordinate):
    print(i , ' ', end='')
print()

Submission status: Accepted

Solution code:
import math
import sys
import collections

# imgur.com/Pkt7iIf.png

def getdict(n):
    d = {}
    if type(n) is list:
        for i in n:
            if i in d:
                d[i] += 1
            else:
                d[i] = 1
    else:
        for i in range(n):
            t = ii()
            if t in d:
                d[t] += 1
            else:
                d[t] = 1
    return d
def cdiv(n, k): return n // k + (n % k != 0)
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(map(int, input().split()))
def lcm(a, b): return abs(a*b) // math.gcd(a, b)

a, b = mi()
print(' '.join(str(x) for x in range(max(-10**6, b-a+1), min(10**6, b+a))))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
def ii(): return int(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def li(): return list(mi())
a, b=mi()
x=b-a+1
y=b+a
for i in range(x, y):
	print(i, end=' ')

Submission status: Accepted

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

k,x = map(int, input().split())
left = x - k + 1
right = x + k - 1
print(*range(left, right + 1))

Submission status: Accepted

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

if(k == 1):
    print(x)
else:
    ans = [i for i in range(x-k+1, x+k)]
    print(" ".join(map(str, ans)))

Submission status: Accepted

Solution code:
values = input()
s = [int(i) for i in values.split()]
r = [i for i in range(-1000000, 1000001)]
print(' '.join(str(i) for i in r[1000001+s[1]-s[0]:1000000+s[1]+s[0]]))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
k,x=map(int,input().split(" "))
possible = []
x2 = x - k + 1
while k + x2 - 1 < 10000 and x2 != k + x:
    possible.append(str(x2))
    x2 += 1
print(" ".join(possible))

Submission status: Accepted

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

Submission status: Accepted

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

if(min_x == max_x):
  print(min_x)
else:
  print(min_x, end="")
  for i in range(min_x+1,max_x+1):
    print(" "+str(i), end="")
  print("")

Submission status: Accepted

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

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

ans = []
for i in range(mi, ma+1):
    ans.append(i)

print(*ans)

Submission status: Accepted

Solution code:
import numpy as np
#K,Xの定義づけ
K,X=map(int,input().split())
#行列の作成
B=np.array(range(-K+X+1,K+X,1))
#printする
for i in B:
  print(i)

Submission status: Accepted

Solution code:
import numpy as np
#K,Xの定義づけ
Y,D=map(int,input().split())
#行列の作成
B=np.array(range(-Y+D+1,Y+D,1))
#printする
for i in B:
  print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k, x = map(int, input().split())
mx = 1000000
ans = ''
ma = 0
mi = 0

mi = (-1) * (k - 1)
ma = k
    
for a in range(mi, ma):
  if a == ma:
    ans += str(x + a)
  else:
    ans += str(x + a) + ' '
  
if k == 1:
  ans = str(x)
  
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

number, index = map(int, input().split())

xMin = index - number + 1
if xMin < -1000000:
  xMin = -1000000

xMax = index + number
if xMax > 1000000:
  xMax = 1000000

list = []

for i in range(xMin, xMax):
  list.append(str(i))

print(" ".join(list))

Submission status: Accepted

Solution code:
def solve(k, x):
    return " ".join(map(str, range(x-k+1, x+k)))


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

    ans = solve(k, x)
    print(ans)


main()

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

Submission status: Accepted

Solution code:
k, x = map(int, input().split())
l = []
for i in range(k):
    l.append(x+i)
    if i > 0:
        l.append(x-i)
l = sorted(l)
for j in range(2*k-1):
    print(l[j], end=" ")

Submission status: Accepted

Solution code:
import sys

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

start_pos = X -K +1
end_pos = X +K -1

if start_pos < -1000000:
    start_pos = -1000000

if end_pos > 1000000:
    end_pos = 1000000

for i in range(start_pos, end_pos):
    sys.stdout.write("%d "%i)

print end_pos

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
     a,b=map(int,input().split())
     print(" ".join(list(map(str,range(b-a+1,a+b)))))
     
if __name__ == '__main__':
     main()

Submission status: Accepted

Solution code:
import numpy as np

k,x = map(int,input().split())
Min = x-k+1
Max = x+k-1
list_1 = []
for i in range(Min,Max+1):
    list_1.append(str(i))
list_2 = ' '.join(list_1)
print(list_2)

Submission status: Accepted

Solution code:
#ABC137-B
#K, X = input().split()
#K = int(K)
#X = int(X)
K, X = map(int, input().split())#複数整数入力はこれ!
print(*list(range(X-(K-1), X+K) ))#複数出力はリストにして*つけて返す。/ range(a,b) = [a, a+1,...b-1]なので注意

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

K,X = inpl()
print(' '.join(map(str,list(range(X-K+1,X+K)))))

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:
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(" ".join(map(str, list)))

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=[str(x+i) for i in range(-k+1,k)]
print(" ".join(ans))

Submission status: Accepted

Solution code:
k, x = map(int, input().split())
start = max(-1000000, x-k+1)
end = min(1000000, x+k-1)
print(" ".join(map(str, range(start, end+1))))

Submission status: Accepted

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

for i in range(front_number, end_number):
    print(i, end=" ")

Submission status: Accepted

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

Submission status: Accepted

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

if K==1:
    print(X)

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

Submission status: Accepted

Solution code:
# coding: utf-8
number = list(map(int,input().split()))
start = number[1]-number[0]+1
last = number[1]+number[0]-1
for i in range(start,last+1):
    if i == last:
        print(i,end="")
    else:
        print(i,end=" ")

Submission status: Accepted

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

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

for i in range(start, end):
  print(i, end=" ")

Submission status: Accepted

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

Submission status: Accepted

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

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

if x-k+1 < -1000000:
	ans = list(range(-1000000, x+k))
elif x+k-1 > 1000000:
  	ans = list(range(x-k+1, 1000001))
else:
  	ans = list(range(x-k+1, x+k))

print(*ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()

K = int(x.split()[0])
X = int(x.split()[1])

result = []

for i in range(2*K - 1):
    result.append(str(X +i - K + 1))

result_1 = ' '.join(result)

print(result_1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
src = input().split()
k = int(src[0])
x = int(src[1])
a = ''
min = x-k+1
max = x+k-1
pos = list(range(min,max+1))
for i in pos:
  a = a + str(i) + ' '
print(a)

Submission status: Accepted

Solution code:
k, x = map(int, input().split())
l = max((k - 1) * -1 + x, -1000000)
r = min((k - 1) + x, 1000000)
res = ""
for i in range(l, r + 1):
  res += str(i)
  if i != r:
    res += " "
print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(' '.join(map(str, list(range(x+1-k, x+k)))))

Submission status: Accepted

Solution code:
K, X = map(int, input().split())
a = ''
for i in range(-1000000, 1000001):
    if i > X - K and i < X + K:
        j = str(i)
        a = a + ' ' + j
    else:
        continue
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=" ")