Problem:


Score : 200 points

Problem Statement

Print all the integers that satisfies the following in ascending order:

Among the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.

Constraints

1 \leq A \leq B \leq 10^9

1 \leq K \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B K

Output

Print all the integers that satisfies the condition above in ascending order.

Sample Input 1

3 8 2

Sample Output 1

3
4
7
8

3 is the first smallest integer among the integers between 3 and 8.

4 is the second smallest integer among the integers between 3 and 8.

7 is the second largest integer among the integers between 3 and 8.

8 is the first largest integer among the integers between 3 and 8.

Sample Input 2

4 8 3

Sample Output 2

4
5
6
7
8

Sample Input 3

2 9 100

Sample Output 3

2
3
4
5
6
7
8
9



Sample input:
3 8 2


Sample output:
3
4
7
8

Submission status: Wrong Answer

Solution code:
a, b, k = map(int, input().split())
if a + k >= b:
  a_k = b
else:
  a_k = a + k

if b - k <= 0:
  b_k = a + 1
else:
  b_k = b - k + 1


result = list(set([i for i in range(a, a_k)] + [i for i in range(b_k, b + 1)]))
result.sort()
for n in result:
  print(n)

Submission status: Wrong Answer

Solution code:
a, b, k = [int(tmp) for tmp in input().split(' ')]
try:
    list_range = list(range(a, b+1))
    result = set(list_range[:k]) | set(list_range[-k:])
    if result:
        for num in sorted(result):
            print(num)
except:
    print('')

Submission status: Wrong Answer

Solution code:
try:
    a, b, k = [int(tmp) for tmp in input().split(' ')]
    list_range = list(range(a, b+1))
    result = set(list_range[:k]) | set(list_range[-k:])
    if result:
        for num in sorted(result):
            print(num)
except:
    print('affdaf')

Submission status: Wrong Answer

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

s = []

if b - a - 1 > k:
    for i in range(k):
        s.append(a + i)
    for i in reversed(range(k)):
        s.append(b - i)
else:
    for i in range(a, b+1):
        s.append(i)

for i in range(len(s)):
    print(s[i])

Submission status: Wrong Answer

Solution code:

a = input().split()

for i in range(len(a)):
 a[i] = int(a[i])

mina = a[0]
maxa = a[1]
numbers = a[2]


for i in range(mina,mina+numbers):
 print (i)

for j in range(maxa-numbers+1,maxa+1):
 if j > i:
  print (j)

Submission status: Wrong Answer

Solution code:
a, b, k = map(int, input().split())
if a + k >= b:
  a_k = b
else:
  a_k = a + k

if b - k <= 0:
  b_k = a
else:
  b_k = b - k


result = list(set([i for i in range(a, a_k + 1)] + [i for i in range(b_k, b + 1)]))
result.sort()
for n in result:
  print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, k = map(int, input().split())
result = [i for i in range(a, b+1) if i <= (a + k) or (b - k) <= i]
print(result)

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split(' '))
SA = set(range(A, A + K))
SB = set(range(B - K + 1, B + 1))
if A + K >= B:
    S = SA & SB
else:
    S = SA | SB

L = sorted(list(S))
for i in L:
    print(i)

Submission status: Wrong Answer

Solution code:
a,b,k =map(int, input().split())
c=list(range(a,a+k))
d=list(range(b-k+1,b+1))
e=set(c+d)
for i in e:
    if a<=i<=b:
        print(i)

Submission status: Wrong Answer

Solution code:
#abc093b
import sys

a,b,k=map(int,raw_input().split())
if a==b:
 print a
 sys.exit()
l1=[i for i in xrange(a,a+k)]
l2=[i for i in xrange( b-k+1,b+1)]
s1=set(l1)
s2=set(l2)
if b-k>=k-a:
 res=list(s1 | s2)
else:
 res=list(s1 & s2)
res.sort()
for i in xrange(len(res)):
 print res[i]

Submission status: Wrong Answer

Solution code:
#abc093b

a,b,k=map(int,raw_input().split())
l1=[i for i in xrange(a,a+k)]
l2=[i for i in xrange( b-k+1,b+1)]
s1=set(l1)
s2=set(l2)
if b-k>=k-a:
 res=list(s1 | s2)
else:
 res=list(s1 & s2)
res.sort()
for i in xrange(len(res)):
 print res[i]

Submission status: Wrong Answer

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

if B-A >= K: 
    for i in range(A, A+K):
        print(i)
    for i in range(B-K+1, B+1):
        print(i)
else:
    for i in range(A, B+1):
        print(i)

Submission status: Wrong Answer

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

if A-B >= K: 
    for i in range(A, A+K):
        print(i)
    for i in range(B-K+1, B+1):
        print(i)
else:
    for i in range(A, B+1):
        print(i)

Submission status: Wrong Answer

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

if A <= K <= B: 
    for i in range(A, A+K):
        print(i)
    for i in range(B-K+1, B+1):
        print(i)
else:
    for i in range(A, B+1):
        print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
*p, = range(A, min(B, A+K))
*q, = range(max(A, B-K)+1,B+1)
print(*sorted(set(p+q)), sep='\n')

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
*p, = range(A, A+K)
*q, = range(B-K+1,B+1)
print(*sorted(set(p+q)), sep='\n')

Submission status: Wrong Answer

Solution code:
inpt = map(int, raw_input().split())

for i in range(inpt[0], inpt[0]+inpt[2]):
	print i
for i in range(inpt[1]-inpt[2]+1, inpt[1]+1):
	if i >= inpt[0]+inpt[2]:
		print i

Submission status: Wrong Answer

Solution code:
a, b, k = map(int, input().split())
a_upper = min(b, a+k)
b_lower = max(a, b-k)
u = set(range(a, a_upper+1))
v = set(range(b_lower, b+1))
for i in sorted(list(u|v)):
  print(i)

Submission status: Wrong Answer

Solution code:
a, b, k = map(int, input().split())
u = set(range(a, a+k+1))
v = set(range(b-k, k+1))
for i in sorted(list(u|v)):
  print(i)

Submission status: Wrong Answer

Solution code:
#abc093b

a,b,k=map(int,raw_input().split())
l1=[i for i in xrange(a,a+k)]
l2=[i for i in xrange( b-k+1,b+1)]
s1=set(l1)
s2=set(l2)
res=list(s1 & s2)
for i in xrange(len(res)):
 print res[i]

Submission status: Wrong Answer

Solution code:
import sys

#A = input('Aを入力してください')
#B = input('Bを入力してください')
#K = input('Cを入力してください')
#print('A= ', A)
#print('B= ', B)
#print('K= ', K)

#A = 1
#B = 10
#K = 6

S = input('ABKを入力してください')
S = S.split()

#for i in range(len(S)):
#    print(S[i])

#sys.exit()

A = int(S[0])
B = int(S[1])
K = int(S[2])

ANS = []
for i in range(K):
    if A + i <= B:
        ANS.append(A + i)


for j in range(K):
    if B - j not in ANS and B - j >= A:
        ANS.append(B - j)

ANS.sort()

#print(ANS)

for i in range(len(ANS)):
    print(ANS[i])

Submission status: Wrong Answer

Solution code:
import sys

#A = input('Aを入力してください')
#B = input('Bを入力してください')
#K = input('Cを入力してください')
#print('A= ', A)
#print('B= ', B)
#print('K= ', K)

#A = 1
#B = 10
#K = 6

S = input('ABKを入力してください')
S = S.split(' ')

#for i in range(len(S)):
#    print(S[i])

#sys.exit()

A = int(S[0])
B = int(S[1])
K = int(S[2])

ANS = []
for i in range(K):
    if A + i <= B:
        ANS.append(A + i)


for j in range(K):
    if B - j not in ANS and B - j >= A:
        ANS.append(B - j)

ANS.sort()

#print(ANS)

for i in range(len(ANS)):
    print(ANS[i])

Submission status: Wrong Answer

Solution code:
import sys

#A = input('Aを入力してください')
#B = input('Bを入力してください')
#K = input('Cを入力してください')
#print('A= ', A)
#print('B= ', B)
#print('K= ', K)

#A = 1
#B = 10
#K = 6

S = input('ABKを入力してください')
S = S.split(' ')

#for i in range(len(S)):
#    print(S[i])

#sys.exit()

A = int(S[0])
B = int(S[1])
K = int(S[2])

ANS = []
for i in range(K + 1):
    ANS.append(A + i)


for j in range(K + 1):
    if B - j not in ANS:
        ANS.append(B - j)

ANS.sort()

#print(ANS)

for i in range(len(ANS)):
    print(ANS[i])

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
x = A
while x < A+K and x <= B:
    print(x)
    x += 1
for y in range(max(x+1, B-K+1), B+1):
    print(y)

Submission status: Wrong Answer

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

out = set()
for i, j in enumerate(range(A, B + 1)):
    if i + 1 > K:
        break
    out.add(j)
for i, j in enumerate(range(B, A + 1, -1)):
    if i + 1 > K:
        break
    out.add(j)

for i in sorted(list(out)):
    print(i)

Submission status: Wrong Answer

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

if (B-A)>2*K:
    for i in range(A,A+K,1):
        print(i)
    for j in range(B-K+1,B+1,1):
        print(j)

else:
    for k in range(A,B+1,1):
        print(k)

Submission status: Wrong Answer

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

if (B-A)>2*K:
    for i in range(A,A+K,1):
        print(i)
    for j in range(B-K,B,1):
        print(j)

else:
    for k in range(A,B+1,1):
        print(k)

Submission status: Wrong Answer

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

for i in sorted(list(set(sorted(list(range(A,A+K))+list(range(B-K+1,B+1)))))):
    print(str(i))

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
K2=B-A
K3=K2-K*2
if K3 > 0:
    for i in range (K):
        print ('%d'%(A+i))
    for i in range (K):
        print ('%d'%(B-K+i+1))
if K3 <= 0:
    for i in range (B-A+1):
        print ('%d'%(A+i))

Submission status: Wrong Answer

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []    
    data = input()
    array_result.append(data.split(" "))

    flg = True

    try:
        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = True

            else:

                flg = False
    finally:

        return array_result

arr_data = getinputdata()

a = int(arr_data[0][0])
b = int(arr_data[0][1])
k = int(arr_data[0][2])

#print(a,b,k)

s1=set()

cnt=0

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

    if cnt<k:
        
        s1.add(i)
        cnt+=1
    else:
        break
        
cnt=0
for i in range(b,a-1,-1):
    
    if cnt<k:
        
        s1.add(i)
        cnt+=1
    else:
        
        break
        

print("\n".join(list(map(str, list(s1)))))

Submission status: Wrong Answer

Solution code:
#coding: utf-8

A, B, K = map(int,input().strip().split(' '))
for ans in list(range(A,A+K))+list(range(B-K+1,B+1)):
    print(ans)

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
K2=B-A
K3=K2-K*2
if K3 > 0:
    for i in range (K):
        print ('%d'%(A+i))
    for i in range (K):
        print ('%d'%(B-K+i))
if K3 <= 0:
    for i in range (B-A+1):
        print ('%d'%(A+i))

Submission status: Wrong Answer

Solution code:
ip=[int(x) for x in input().split()]
a=ip[0];b=ip[1];k=ip[2]
ans=list()
for i in range(0,k):
    ans.append(a)
    ans.append(b)
    a=a+1
    b=b-1
    if((a==ip[1])|(b==ip[0])):
        break
res=list(set(ans))
res.sort()
for i in res:
    print(i)

Submission status: Wrong Answer

Solution code:
A,B,K=map(int,input().split())
S=[]
for i in range(A,max([A+K,B+1])):
  S.append(i)
for i in range(min([B-K+1,A]),B+1):
  S.append(i)
S.sort()
for i in S:
  print(i)

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
A, B, K = input().split()

A = int(A)
B = int(B)
K = int(K)

value = []

if A == B:
    print(A)
    sys.exit()
    
elif B <= K:
    value.extend([i for i in range(A, B+1)])
else:
    value.extend([i for i in range(A, A+K)])
    value.extend([i for i in range(B-K+1, B+1)])    

num = list(set(value))
num.sort()

for i in range(len(num)):
    print(num[i])

Submission status: Wrong Answer

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

K2=B-A
K3=K2-K*2
if K3 > 0:
    for i in range (K):
        print ('%d'%(A+i))
    for i in range (K):
        print ('%d'%(B-K+i))

Submission status: Wrong Answer

Solution code:
lst=[]
a,b,k=map(int,input().split())
x=a
for i in range(k):
    if x<=b:
        if x not in lst:
            lst.append(x)
            x+=1
    else:
        break
x=b-k+1
for i in range(k):
    if a<x<=b and x not in lst:
        lst.append(x)
        x+=1
    else:
        continue

for num in lst:
    print(num)

Submission status: Wrong Answer

Solution code:
a = input()
b = a.split()
c = list(map(int,b))
i = c[0]
if c[2]>=((c[1]-c[0])+1)/2+0.5:
    while i <=c[1]:
        print(i)
        i=i+1
        
else:
    for x in range(c[2]):
        print(c[0]+x)
    for y in range(c[2]):
        print(c[1]+y-1)

Submission status: Wrong Answer

Solution code:
A,B,K = (int(i) for i in input().split())

num = []
def plus():
    for i in range(A,A+K):
        num.append(i)

    for i in range(B-K+1,B+1):
        num.append(i)
    print(num)
    num.sort()
    while 0 < len(num):
        del num[0]


if B-A<K:
    for i in range(A,B+1):
        print(i)
else:
    plus()

Submission status: Wrong Answer

Solution code:
A, B, K = input().split()

A = int(A)
B = int(B)
K = int(K)

value = []

if B <= K:
    value.extend([i for i in range(A, B+1)])

else:
    value.extend([i for i in range(A, A+K)])
    value.extend([i for i in range(B-K+1, B+1)])    


num = list(set(value))
num.sort()
for i in range(len(num)):
    print(num[i])

Submission status: Wrong Answer

Solution code:
A, B, K = input().split()

A = int(A)
B = int(B)
K = int(K)

value = []

if B < K:
    value.extend([i for i in range(A, B+1)])

else:
    value.extend([i for i in range(A, A+K)])
    value.extend([i for i in range(B-K+1, B+1)])    


num = list(set(value))
num.sort()
for i in range(len(num)):
    print(num[i])

Submission status: Wrong Answer

Solution code:
A,B,K = (int(i) for i in input().split())

num = []
def plus():
    for i in range(A,A+K):
        num.append(i)

    for i in range(B-K+1,B+1):
        num.append(i)
    print(num)
    num.sort()
    while 0 < len(num):
        print(num[0])
        del num[0]


if B-A<K:
    for i in range(A,B+1):
        print(i)
else:
    plus()

Submission status: Wrong Answer

Solution code:
a = input()
b = a.split()
c = list(map(int,b))
i = c[0]
if c[2]>=((c[1]-c[0])+1)/2-0.5:
    while i <=c[1]:
        print(i)
        i=i+1
        
else:
    for x in range(c[2]):
        print(c[0]+x)
    for y in range(c[2]):
        print(c[1]+y-1)

Submission status: Wrong Answer

Solution code:
A,B,K = (int(i) for i in input().split())

num = []
def plus():
    for i in range(A,A+K):
        num.append(i)

    for i in range(B-K,B):
        num.append(i)
    print(num)
    num.sort()
    while 0 < len(num):
        print(num[0])
        del num[0]


if B-A<K:
    for i in range(2,9):
        print(i)
else:
    plus()

Submission status: Wrong Answer

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

box = []
for i in range(k):
    box.append(a+i)
    box.append(b-i)
out = set(box)
out = list(out)
out = [i for i in out if i>=a and i<=b]
sorted(out)
for i in out:
    print(i)

Submission status: Wrong Answer

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

i = 0
while i<s[2]:
   if (i+s[0])>s[1]:
      i += 1
   elif (i+s[0])<=s[1]:
      ans.append(int(i + s[0]))
      i += 1

i = 0
while  i<s[2]:
   if (s[1]-i)>=s[0]:
       ans.append(int(s[1]-i))
       i += 1
   elif (s[1]-i)<s[0]:
       i += 1

ans = list(set(ans))

for a in ans:
   print(a)

Submission status: Wrong Answer

Solution code:
#!/bin/python
 
a, b, k = map(int, input().split())
for i in range(a, min(a + k, b)):
    print(i)
 
for i in range(max(a + k, b - k + 1), min(a + k, b + 1)):
    print(i)

Submission status: Wrong Answer

Solution code:
#!/bin/python

a, b, k = map(int, input().split())
for i in range(a, min(a + k, b)):
    print(i)

for i in range(max(a + k, b - k + 1), min(a + k, b + 1)):
    print(i)

Submission status: Wrong Answer

Solution code:
ip=[int(x) for x in input().split()]
a=ip[0]
b=ip[1]
k=ip[2]
if k>=(b-a+1):
  for i in range(a,b+1):
    print(i)
else:
	lw=list(range(a,a+k))
	hg=list(range(b-k,b))
	res=list(set(lw+hg))
	res.sort()
	for i in res:
  		print(i)

Submission status: Wrong Answer

Solution code:
a = input()
b = a.split()
c = list(map(int,b))
i = c[0]
if c[2]>=((c[1]-c[0])+1)/2:
    while i <=c[1]:
        print(i)
        i=i+1
        
else:
    for x in range(c[2]):
        print(c[0]+x)
    for y in range(c[2]):
        print(c[1]+y-1)

Submission status: Wrong Answer

Solution code:
from collections import deque

A, B, K = input().split()

A = int(A)
B = int(B)
K = int(K)

value = deque()
s = [i for i in range(A, B+1)]

value.extend(s[0:K])
value.extend(s[len(s)-K:len(s)])

num = deque(list(set(value)))

for i in range(len(num)):
    print(num[i])

Submission status: Wrong Answer

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

if 2 * k < b - a:
    ll = [int(i) for i in range(a, a + k)] + [int(i) for i in range(b + 1 - k, b + 1)]
else:
    ll = [int(i) for i in range(a, b + 1)]

for j in range(len(ll)):
    print(ll[j])

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
A,B,K =map(int,input().split())
l=[]
K-=1
if B-A<K*2:
    num3=A
    while num3<=B:
        l.append(str(num3))
        num3+=1
else:
    num1=A
    while num1<=A+K:
        l.append(str(num1))
        num1+=1
    num2=B-K
    while num2<=B:
        l.append(str(num2))
        num2+=1
l=list(set(l))
l=sorted(l)
for ans in l:
    print(ans)

Submission status: Wrong Answer

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

if 2 * k < b - a:
    ll = [int(i) for i in range(a, k + 1)] + [int(i) for i in range(b + 1 - k, b + 1)]
else:
    ll = [int(i) for i in range(a, b + 1)]

for j in range(len(ll)):
    print(ll[j])

Submission status: Wrong Answer

Solution code:
a,b,k=map(int,input().split())
x=a
se=set([])
for i in range(k):
    if x<b:
        se.add(x)
        x+=1
    else:
        break
x=b-k+1
for i in range(k):
    if x<=b:
        se.add(x)
        x+=1
    else:
        break
for num in se:
    print(num)

Submission status: Wrong Answer

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

s = set()
for i in range(a, b + 1):
    if i >= a + k:
        break
    s.add(i)

for i in range(b - k + 1, b + 1):
    s.add(i)

for i in sorted(s):
    print(i)

Submission status: Wrong Answer

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

if B-A > K:
    for i in range(A, A+K):
        print(i)
    for i in range(B-K+1, B+1):
        print(i)

else:
    for i in range(A, B+1):
        print(i)

Submission status: Wrong Answer

Solution code:
A,B,K=map(int,input().split())
length=B-A+1
 
if round(length/2)>K:
    for i in range(A,A+K):
        print(i)
    for i in range(B-K+1,B+1):
        print(i)
else:
    for i in range(A,B+1):
        print(i)

Submission status: Wrong Answer

Solution code:
S = input().split(' ')
a = int(S[0])
b = int(S[1])
c = int(S[2])

if (b - a)/ 2 <= c:
    while a <= b:
        print(a)
        a += 1
else:
    for i in range(c):
        print(a + i)
    b = b - c +1
    for j in range(c):
        print(b + j)

Submission status: Wrong Answer

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

# l = [int(i) for i in range(a, b + 1)]

if 2 * k < b - a:
#    ll = l[:k] + l[-k:]
    ll = [int(i) for i in range(a, k + 1)] + [int(i) for i in range(b + 1 - k, b + 1)]
else:
    ll = [int(i) for i in range(a, b + 1)]

for j in range(len(ll)):
    print(ll[j])

Submission status: Wrong Answer

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

#s = [i for i in range(A,B+1)]


if 2 * K >= B- A + 1:
    for j in range(A,B+1):
        print(j)

    exit()

#l = [s[i] for i in range(0,K)]
#k = [s[h] for h in range(len(s) - K, len(s))]

for a in range(A,K+1):
    print(a)
for b in range(B-K+1,B+1):
    print(b)

#for t in range(0,K):
#    print(s[t])

# s.reverse()

#for h in range(len(s) - K,len(s)):
#    print(s[h])

Submission status: Wrong Answer

Solution code:
s = input().split()
one = int(s[0])
two = int(s[1])
three = int(s[2])
if two < three:
	three=two
oss=[]
for i in range(three):
    k=one+i
    if k < two:
        oss.append(k)
for i in range(three):
    k=two-i
    if k > one:
        oss.append(k)
rlt = list(set(oss))
rlt.sort()
for i in rlt:
    print(i)

Submission status: Wrong Answer

Solution code:
A,B,K = map(int,input().split())
a = A
b = B
for a in range(A-1,A+K-1):
	a += 1
	print(a)
for b in range(B-K,B):
	b += 1
	if b > A + K - 1:
		print(b)

Submission status: Wrong Answer

Solution code:
s = input().split()
one = int(s[0])
two = int(s[1])
three = int(s[2])
if two < three:
	three=two
oss=[]
for i in range(three):
    k=one+i
    if k < two:
        oss.append(k)
for i in range(three):
    k=two-i
    if k > one:
        oss.append(k)
rlt = list(set(oss))
for i in rlt:
    print(i)

Submission status: Wrong Answer

Solution code:
S = input().split(' ')
a = int(S[0])
b = int(S[1])
c = int(S[2])

if (b - a)/ 2 <= c:
    while a <= b:
        print(a)
        a += 1
else:
    for i in range(c):
        print(a + i)
    for j in range(c):
        print(b - j)

Submission status: Wrong Answer

Solution code:
a, b, k= map(int, input().split())
for x in range(a,min(a+k,b+1)):
    print(x)
for x in range(b-k+1,b+1):
    if x < a+k:
        continue
    else:
        print(x)
for x in range(a,a+k):
    print(x)

Submission status: Wrong Answer

Solution code:
from collections import deque

A, B, K = input().split()

A = int(A)
B = int(B)
K = int(K)

if B < K:
    for i in range(A, B+1, 1):
        print(i)
else:
    value = deque()
    s = [i for i in range(A, B+1)]

    value.extend(s[0:K])
    value.extend(s[len(s)-K:len(s)])

    num = list(set(value))

    for i in range(len(num)):
        print(num[i])

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
A,B,K =map(int,input().split())
l=[]
K-=1
if B-A>K*2:
    num1=A
    while num1<=A+K:
        l.append(str(num1))
        num1+=1
    num2=B-K
    while num2<=B:
        l.append(str(num2))
        num2+=1
#else:
elif B-A==K*2:
    num3=A
    while num3<=B:
        l.append(str(num3))
        num3+=1
l=sorted(l)
for ans in l:
    print(ans)

Submission status: Wrong Answer

Solution code:
S = input().split(' ')
a = int(S[0])
b = int(S[1])
c = int(S[2])

if (b - a)/ 2 < c:
    while a <= b:
        print(a)
        a += 1
else:
    for i in range(c):
        print(a + i)
    for j in range(c):
        print(b - j)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

C = list(int(i) for i in input().split())
A = []
B = []
D = []
for i in range(C[0], C[0]+C[2]):
    A.append(i)
for i in range(C[1]-C[2]+1, C[1]+1):
    B.append(i)
for i in range(C[2]):
    print(A[i])
for i in range(C[2]):
    if B[i] not in A:
        print(B[i])

Submission status: Wrong Answer

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

box = []
for i in range(k):
    box.append(a+i)
    box.append(b-i)
out = set(box)
sorted(out)
for i in out:
    print(i)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
inputs = input().split()
A = int(inputs[0])
B = int(inputs[1])
K = int(inputs[2])


if A + K < B - K:
    candidates = np.concatenate([np.arange(A, A + K), np.arange(B - K, B)])
else:
    candidates = np.arange(A, B + 1)
    candidates = candidates[np.logical_or(candidates < A + K, candidates > B - K)]

for s in np.sort(candidates):
    print(s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
A,B,K = map(int,S.split())

if ((B-A)/2 > K):
	for iA in range(A,A+K):
		print(iA)
	for iB in range((B-K+1),B+1):
  		print(iB)
       	
else:
  	for i in range(A,B+1):
	  	print(i)

Submission status: Wrong Answer

Solution code:
a, b, k = map(int, input().split())
s = set()
l = range(a, b+1)

if len(l) <= k:
    for i in l:
        print(i)
else:
    for j in l[:k]:
        s.add(j)
    
    for j in l[len(l)-k+1:]:
        s.add(j)

    m = sorted(list(s))
    for i in m:
        print(i)

Submission status: Wrong Answer

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

l = [int(i) for i in range(a, b + 1)]

if 2 * k < b - a:
    ll = l[:k] + l[-k:]
else:
    ll = l

for i in range(len(ll)):
    print(ll[i])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if abs(A-B)<K:
    for i in range(A, B+1):
        print(i)
else:
    x = {i for i in range(A, A+K)}
    y = {j for j in range(B-K+1, B+1)}
    z = x | y
    z = sorted(list(z))
    print(z)
    for a in z:
        print(a)

Submission status: Wrong Answer

Solution code:
A,B,K=map(int,input().split())
for i in range(K):
    print(A+i)
if B-A+1<K*2:
    a=B-A+1
    b=K*2-a
    for i in range(K-b):
        print(B-(K-b)+1+i)
else :
    for j in range(K):
        print(B-K+j+1)

Submission status: Wrong Answer

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

if b - a > k:
    for i in range(a, a + k):
        print(i)
    for i in range(b - k + 1, b + 1):
        print(i)
else:
    for i in range(a, b + 1):
        print(i)

Submission status: Wrong Answer

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

ret = []
for i in range(a, a + k):
    ret.append(i)

for i in range(b - k + 1, b + 1):
    ret.append(i)

res = sorted(set(ret), key=ret.index)
for i in res:
    print(i)

Submission status: Wrong Answer

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

list_num = []
a_max = -1
for i in range(K):
    if A+i <= B:
        a_max = A+i
        print(a_max)

tmp = K
for i in range(K+1):
    if B - tmp > a_max:
        print(B - tmp)
    tmp -= 1

Submission status: Wrong Answer

Solution code:
# coding=utf-8


def from_down(base, number, upper):
    return_list = []
    range_upper = min(upper+1, base+number)
    for i in range(base, range_upper):
        return_list.append(i)
    return return_list


def from_up(base, number, down):
    return_list = []
    range_down = max(base-number+1, down)
    for i in range(range_down, base+1):
        return_list.append(i)
    return return_list


def remove_double(object_list):
    list_unique = []
    for x in object_list:
        if x not in list_unique:
            list_unique.append(x)
    return list_unique


if __name__ == '__main__':
    A, B, K = map(int, input().split())
    down_list = from_down(A, K, B)
    upper_list = from_up(B, K, A)
    print(down_list)
    print(upper_list)
    down_list.extend(upper_list)
    print(down_list)
    unique_list = remove_double(down_list)
    print(unique_list)

Submission status: Wrong Answer

Solution code:
a ,b, k = map(int,input().split())
ans = []
if b - a  -1<= k //2:
    for i in range(a , b + 1):
        print(i)
else:
    for i in range(k ):
        ans.append(a + i)
    for i in range(k ):
        i = k - i -1
        ans.append(b - i)
    ans = sorted(set(ans))
    for i in ans:
        print(i)

Submission status: Wrong Answer

Solution code:
A, B, K = list(map(int, input().split()))
x = {i for i in range(A, A+K)}
y = {j for j in range(B-K+1, B+1)}
z = x | y
z = sorted(list(z))
for a in z:
	print(a)

Submission status: Wrong Answer

Solution code:
x = list(map(int, input().split()))
res=[]

if x[0]+x[2]-1>=x[1]-x[2]:
    for i in range(x[0],x[1]+1):
        print(i)
    quit()

for i in range(x[0],x[0]+x[2]):
    res.append(i)
for i in range(x[1]-x[2]+1,x[1]+1):
    res.append(i)

print(res)

Submission status: Wrong Answer

Solution code:
a, b, k = map(int, input().split())		# 5 7 2


ans=[]
count=0
for i in range(a, b+1):
	ans.append(i)
	count += 1
	if count > k: break

count=0
for i in range(b, a-1, -1):
	ans.append(i)
	count += 1
	if count > k: break

ans = sorted(set(ans), key=ans.index)

for i in ans:
	print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
re = list()
a,b,k = map(int, raw_input().split())
li = [i for i in xrange(a,b+1)]
for i in xrange(0,k):
    if i < len(li)-1:
        re.append(li[i])
        re.append(li[-(i+1)])
for i in sorted(list(set(re))):
    print i

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
A,B,K =map(int,input().split())
l=[]
K-=1
if B-A>K*2:
    num1=A
    while num1<=A+K:
        l.append(str(num1))
        num1+=1
    num2=B-K
    while num2<=B:
        l.append(str(num2))
        num2+=1
else:
    num3=A
    while num3<=B:
        l.append(str(num3))
        num3+=1
l=sorted(l)
for ans in l:
    print(ans)

Submission status: Wrong Answer

Solution code:
def small_and_large_integers(A,B,K):
    for i in range(K):
        if A+i > B: return
        print(A+i)
    for i in range(K):
        print(B-K+1 +i)

def main():
    i = input()
    A,B,K = i.split()
    A,B,K = int(A), int(B), int(K)
    small_and_large_integers(A,B,K)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from collections import deque

A, B, K = input().split()

A = int(A)
B = int(B)
K = int(K)

value = deque()
s = [i for i in range(A, B+1)]

value.extend(s[0:K])
value.extend(s[len(s)-K:len(s)])

num = list(set(value))

for i in range(len(num)):
    print(num[i])

Submission status: Wrong Answer

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

array = []
array2 = []
for i in range(a, a+k):
    if i > b:
        break
    array.append(i)
for i in range(b-k+1, b+1):
    if i <= 0:
        continue
    array2.append(i)

for i in sorted(set(array+array2)):
    print(i)

Submission status: Wrong Answer

Solution code:
def main():
    A, B, K = (int(i) for i in input().split())
    result = set()
    A_min = min(A+K, B)
    B_max = max(A, B-K)
    for i in range(A, A_min):
        result.add(i)
    for j in range(B_max, B+1):
        result.add(j)

    for i in sorted(result):
        print(i)
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
data = input().split(" ");
A = data[0];
B = data[1];
K = data[2];

for lop in range(int(A),int(A)+int(K)):
    print(lop);
    fg = lop;
        
if int(B)-int(K)+1 >= int(A):
    if fg+1 < int(B)-int(K)+1:
        fg = int(B)-int(K)+1;
    else:
        fg+=1
    for lop in range(fg,int(B)):
        print(lop);
    print(B);