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

Submission status: Accepted

Solution code:
def solve():
    N, M = map(int, input().split())
    l = [i for i in range(M-(N-1), M+(N-1)+1)]
    print(*l)

# print(solve())

# def solve()が@return voidのとき
solve()

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:
x,y=list(map(int, input().split()))
z=[0]*(x*2-1)

for i in range(x*2-1):
	z[i]=y-(x-1)
	y=y+1
print(*z)

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=list(map(int,input().split()))
l=[]
l.append(x)
for i in range(1,k):
    l.append(x-i)
    l.append(x+i)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(*C)

Submission status: Accepted

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

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

print(*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())
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=" ")

print()

Submission status: Accepted

Solution code:
K, X = map(int, input().split())
start = (X - (K - 1))
end = (X + (K - 1))
upper = 1000000
lower = -1000000

if start < lower:
    start = lower

if end > upper:
    end = upper

print(' '.join([str(n) for n in range(start, end + 1)]))

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())
ans = []
for i in range(X - K + 1, X + K):
    ans.append(i)
answer = ' '.join(map(str, ans))
print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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-k+1,k+x):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())
ans = list()
for i in range(X-(K-1), X+K):
    ans.append(i)
print(" ".join(map(str, ans)))

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(X-K+1, X+K):
    ans.append(i)
print(' '.join(map(str, ans)))

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
#import numpy as np
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())

K, X = map(int, input().split())
rmin = -1* (10 ** 6)
rmax = (10 ** 6)

lmin = max(rmin, X-K+1)
lmax = min(rmax, X+K-1)

ans = str(lmin)
for i in range(lmin+1, lmax+1) :
  ans += " " + str(i)

print (ans)

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
import math
a,b= map(int,input().split())
#=int(input())
#a, b, c = [list(map(int, input().split())) for _ in range(3)]
#li0= [int(x) for x in input().split()]

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

Submission status: Accepted

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

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

for i in range(l, r+1):
    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:
from sys import stdin

k, x = (int(x) for x in stdin.readline().rstrip().split())

l = [int(x) for x in range(x-(k-1), x+(k-1) + 1)]

print(*[i for i in l if -1e7 <= i <= 1e7])

Submission status: Accepted

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

Submission status: Accepted

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

l = []
for i in range(1,2*k):
    t = x-k+i
    l.append(str(t))
print(' '.join(l))

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
import os


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

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

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

    print(*ret)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import os


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

    K, X = list(map(int, sys.stdin.readline().split()))
    MAX = 1000000
    MIN = -1000000

    ret = [X]
    for i in range(1, K):
        if X + i <= MAX:
            ret.append(X+i)
        else:
            ret.append(X - K)

        if X - i >= MIN:
            ret.append(X-i)
        else:
            ret.append(X + K)

    print(*sorted(set(ret)))

if __name__ == '__main__':
    main()

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())
mi=max(-1000000,x-k+1)
mx=min(1000000,x+k-1)
a=[]
for i in range(mi,mx+1):
    a.append(i)


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

Submission status: Accepted

Solution code:
#import math
#import bisect
#import numpy as np
#import itertools
#import copy
import sys

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

def main():
    k, x = list(map(int,ipti().split()))
    minlim = x - (k-1)
    maxlim = x + (k-1)

    ans = [_ for _ in range(minlim, maxlim + 1)]
    print(*ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

MIN=K-N+1
MAX=K+N-1

for i in range(MIN,MAX+1,1):
    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(' '.join(ans))

Submission status: Accepted

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

arr = list(range(x-k+1,x+k))
for i in range(len(arr)-1):
    print(arr[i],end = ' ')
print(arr[-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K,X=map(int,input().split())
a=''
for i in range(X-K+1,X+K):
    a+=str(i)+' '
print(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 = []
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())
ans = []
for i in range(x-k+1, x+k):
    ans.append(i)
print(' '.join(map(str, ans)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k, x = list(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("{} ".format(i),end="")

print()

Submission status: Accepted

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

num = 2*K -1
ans =[]

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


for i in range(num):
  print(ans[i],end=" ")

Submission status: Accepted

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

Submission status: 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, end=" ")
    else:
        print (i)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
k,x = map(int,input().split())
s = ''
for i in range(max(-10**5,x-(k-1)),min(10**5,x+(k-1))+1):
    s += str(i)+' '
print(s[:-1])

Submission status: Accepted

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

Submission status: Accepted

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

ans = []

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

print(" ".join(ans))

Submission status: Accepted

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

print(*list(range(st,en)))

Submission status: Accepted

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

Submission status: Accepted

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

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=" ")
print()

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

L = X-K+1
R = X+K-1

print(' '.join(map(str,range(L,R+1))))

Submission status: Accepted

Solution code:
l1 = input().split()
k = int(l1[0])
x = int(l1[1])
arr = []
if k >1 :
    for i in range(x-(k-1), x+1+(k-1)):
        print(i, end=" ")
else:
    print(x)

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

for i in range ((max(-1000000,X-K+1)),min(1000001,X+K)):
    black.append(str(i))

ans = " ".join(black)
print(ans)

Submission status: Accepted

Solution code:
K,X = map(int,input().split())
A = (K-1)*2 +1
ans = list()
for i in range(A):
  ans.append(X-K+1+i)
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())
print(" ".join([str(i) for i in range(x-k+1, x+k)]))

Submission status: Accepted

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

res = []

for i in range(-(x-1)+y, x+y):
    res.append(i)

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

Submission status: Accepted

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

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

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())
#x-k+1-x+k-1
for i in range(x-k+1, x+k):
    if i > 1000000 or i < -1000000:
        pass
    else:
        print(i)

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

k, x = map(int, sys.stdin.readline().split())

def main():
    l = max(-10 ** 6, x - (k - 1))
    r = min(10 ** 6, x + (k - 1))
    return range(l, r + 1)

if __name__ == '__main__':
    ans = main()
    print(*ans, sep =' ')

Submission status: Accepted

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

Submission status: Accepted

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

m = max(-1000000, X - K + 1)
M = min(1000000, X + K - 1)

print(" ".join(str(i) for i in range(m, M + 1)))

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = ''

for i in range(1, 2*k):
  ans += str(x-k+i) + ' '
  
print(ans.rstrip())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math


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


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

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

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:
n,k=map(int,input().split())
for i in range(max(-1000000,k-n+1),min(1000001,n+k)):
  print(i)

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:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc137/tasks/abc137_b

k, x = [int(x) for x in input().split()]
if x - k + 1 < -1000000:
    mi = -1000000
    ma = x + k - 1
if x + k - 1 > 1000000:
    mi = x - k + 1
    ma = 1000000
else:
    mi = x - k + 1
    ma = x + k - 1
r = map(str, list(range(mi, ma + 1)))
print(" ".join(r))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

min = b -a + 1
max = b +a - 1

print(*[i for i in range(min,max+1)])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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 accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

K, X = MAP()

for i in range(X - K + 1 , X + K):
	if i < -1000000:
		continue
	if i > 1000000:
		continue
	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())

def create_num(K,X):
    ans = [X-(K-1) + i for i in range(K*2-1)]
    return ans

if K == 1:
    print(X)
else:
    ans = create_num(K,X)
    L=[str(a) for a in ans]
    L=" ".join(L)
    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)) + list(range(x, x+k)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
a, b = map(int, input().split())
c = b - a + 1
d = b + a
for i in range(c, d):
    print(i, end=" ")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# アンパック。リストを分割して渡す。
print(*ans_list)

Submission status: Accepted

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

ans_list = []
for i in range(x-k+1, x+k):
    if -1000000 <= i <= 1000000:
        ans_list.append(str(i))

print(" ".join(ans_list))

Submission status: Accepted

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

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())
Brack=range(X-K+1,X+K)
print(*Brack)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

for i in range(len(List)):
    print(List[i], end =' ')

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:
K, X = map(int, input().split())
if (X-K+1 > -1000000) and (X+K < 1000000):
  print(' '.join([str(i) for i in range(X-K+1, X+K)]))
elif (X-K+1 < -1000000) and (X+K < 1000000):
  print(' '.join([str(i) for i in range(-1000000, X+K)]))
elif (X-K+1 > -1000000) and (X+K > 1000000):
  print(' '.join([str(i) for i in range(X-K+1, 1000000)]))
elif (X-K+1 < -1000000) and (X+K > 1000000):
  print(' '.join([str(i) for i in range(1000000, 1000000)]))

Submission status: Accepted

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

right = X + K_ko - 1
right = min(right, 10 ** 6)
left = X + 1 - K_ko
left = max(left, -10 ** 6)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

minimum = max(-1000000, x-k+1)
maximum = min(1000000, x+k-1)

ans = ''
for i in range(minimum, maximum+1):
  ans = ans + str(i) + ' '

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

result=[]

for i in range(x-k+1,x+k):
    result.append(str(i))

print(" ".join(result))

Submission status: Accepted

Solution code:
import sys

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

IN=lambda : map(int, input().split())
mod=1000000007

#+++++

def main():
	b , c = IN()
	s = list(range(c-b+1,c+b-1+1))
	print(' '.join([str(c) for c in s]))
	
	
#+++++
isTest=False

def pa(v):
	if isTest:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

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

a=list(range(-k+1,k))

for b in a:
    print(x+b,"",end="")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(K: int, X: int):
    print(' '.join(map(str, [i for i in range(max(-1000000, X-K+1), min(1000000, 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())
ans = ""
if k == 1 :
	print(x)
	exit()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

output = []

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

print(" ".join(output))

Submission status: Accepted

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

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

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, end=" ")
  else:
    print(i)

Submission status: Accepted

Solution code:
#137 b
k,x=map(int,input().split())
k=k-1
num=[i for i in range(x-k,x+k+1)]
ans=""
for n in num:
    ans+=(str(n)+" ")
print(ans)

Submission status: Accepted

Solution code:
k,x=(int(x) for x in input().split())
left=x-(k-1)
right=x+(k-1)
l=[]
while(left<=right):
    if -1000000<=left<=1000000:
        l.append(str(left))
    left+=1
print(" ".join(l))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K, X = map(int, input().split())
ans = []
for i in range(X - K + 1, X + K):
        ans.append(i)
print(" ".join(map(str, 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:
k, x = [int(x) for x in input().split()]

lst = []

def chk(num):
    if num < -1000000:
        return -1000000
    elif num > 1000000:
        return 1000000
    else:
        return num

for i in range(x-k + 1, k + x):
    lst.append(chk(i))

print(*sorted(lst))

Submission status: Accepted

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

Submission status: Accepted

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

res = ""
for i in range(X-(K-1), X+K):
    res += " " + str(i)

print(res[1:])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

st = X-(K-1)
ed = X+(K-1)

res = ""
for i in range(max({-1000000, st}), min({ed, 1000000})+1):
    res += " " + str(i)

print(res[1:])

Submission status: Accepted

Solution code:
K,X=map(int,input().split())
list_x=[0]*(((K-1)*2)+1)
k=K-1
p=0
for i in range(K-1):
  list_x[p]=X-k
  k=k-1
  p=p+1
list_x[p]=X
k=1
p=p+1
for i in range(K-1):
  list_x[p]=X+k
  k=k+1
  p=p+1
for i in range(((K-1)*2)+1):
  print(str(list_x[i])+' ',end='')

Submission status: Accepted

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

Submission status: Accepted

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