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())
li = []
if 2 *k >= b - a:
    print([x for x in range(a,b+1)])
else:
    for i in range(k):
        li.append(a + i)
    for i in range(k):
        li.append(b - i)
    for i in sorted(set(li)):
        print(i)

Submission status: Wrong Answer

Solution code:
a,b,k = map(int,input().split())
li = []
if 2 *k >= b - a:
    print([x for x in range(a,b+1)])
else:
    for i in range(k):
        li.append(a + i)
    for i in range(k):
        li.append(b - i)
    for i in sorted(li):
        print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(K):
    if A + i > B - i:
        break
    else:
        L.append(A + i)
        L.append(B - i)

L = sorted(L)
L = set(L)

for l in L:
    print(l)

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
L = [range(A, B + 1)]
if len(L) <= 2 * K:
    for l in L:
        print(l)
else:
    ans = []
    for i in range(K):
        ans.append(L[i])
        ans.append(L[-i])
    for a in ans:
        print(a)

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
L = []
for i in range(A, A + K):
    L.append(i)

for j in range(B - K + 1, B + 1):
    L.append(j)

L = sorted(L, reverse=True)

for l in set(L):
    if A <= l <= B:
        print(l)

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
L = []
for i in range(A, A + K):
    L.append(i)

for j in range(B - K + 1, B + 1):
    L.append(j)

L = sorted(L, reverse=True)

for l in L:
    print(l)

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
L = []
for i in range(A, A + K):
    L.append(i)

for j in range(B - K + 1, B + 1):
    L.append(i)

L = sorted(L, reverse=True)

for l in L:
    print(l)

Submission status: Wrong Answer

Solution code:
a,b,k=map(int,input().split())
s=set()
for i in range(min(k,b-a)):
  s.add(a+i)
  s.add(b-i)
arr=list(s)
arr=sorted(arr)
for i in arr:
  print(i)

Submission status: Wrong Answer

Solution code:
a,b,k=map(int,input().split())
s=set()
for i in range(k):
  s.add(a+i)
  s.add(b-i)
arr=list(s)
arr=sorted(arr)
for i in arr:
  print(i)

Submission status: Wrong Answer

Solution code:
# /usr/bin/python
# -*- coding: utf-8 -*-
#
import math


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

ans = []
for i in range(a,min(b,a+k)):
  if i not in ans:
    ans.append(i)
for i in range(b,max(a,b-k),-1):
  if i not in ans:
    ans.append(i)

ans = sorted(ans)
for a in ans:
  print(a)

Submission status: Wrong Answer

Solution code:
lists = input().split()
a = int(lists[0])
b = int(lists[1])
x = int(lists[2]) * 2
answer  = []
next = 0
for num in range(0, x):
    if(a == b):
        answer.append(a)
        break
    answer.append(a)
    answer.append(b)
    a += 1
    b -= 1
    if(len(answer) >= x * 2 or a > b or b < 0):
        break
    if(a == b):
        answer.append(a)
        if(a + num < b - num):
            for b_num in range(b, a):
                answer.append(b_num)
                if (len(answer) > x * 2):
                    break
        elif(a + num > b - num):
            for a_num in range(a, b):
                answer.append(a_num)
                if (len(answer) > x * 2):
                    break
        break
answer.sort()
for a in answer:
    print(a)

Submission status: Wrong Answer

Solution code:
lists = input().split()
a = int(lists[0])
b = int(lists[1])
x = int(lists[2]) * 2
answer  = []
next = 0
for num in range(0, x):
    answer.append(a)
    answer.append(b)
    a += 1
    b -= 1
    if(len(answer) >= x or a > b or b < 0):
        break
    if(a == b):
        if(a + num < b - num):
            for b_num in range(b, a):
                answer.append(b_num)
                if (len(answer) >= x):
                    break
        elif(a + num > b - num):
            for a_num in range(a, b):
                answer.append(a_num)
                if (len(answer) >= x):
                    break

        break
answer.sort()
for a in answer:
    print(a)

Submission status: Wrong Answer

Solution code:
lists = input().split()
a = int(lists[0])
b = int(lists[1])
x = int(lists[2]) * 2
answer  = []
next = 0
for num in range(0, x):
    answer.append(a)
    answer.append(b)
    if (len(answer) >= x):
        break
    a += 1
    b -= 1
    if(a == b):
        if(a + num < b - num):
            for b_num in range(b, a):
                answer.append(b_num)
                if (len(answer) >= x):
                    break
        elif(a + num > b - num):
            for a_num in range(a, b):
                answer.append(a_num)
                if (len(answer) >= x):
                    break
        break
answer.sort()
for a in answer:
    print(a)

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
seisu = [i for i in range(A, B + 1)]
mitasu_seisu = []
ans = []
mitasu_seisu.append(seisu[:K])
mitasu_seisu.append(seisu[-K:])
for j in mitasu_seisu:
    for k in j:
        ans.append(k)
for l in list(set(ans)):
    print(l)

Submission status: Wrong Answer

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

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

for i, n in enumerate(num, 1):
  if i <= K or i > B - A - K:
    print(n)

Submission status: Wrong Answer

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

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

for i, n in enumerate(num, 1):
  if i <= K or i > B - A - K:
    print(i)

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
if A + B < K:
    res = [i for i in range(A, B + 1)]
else:
    nums1 = [j for j in range(A, A + K)]
    nums2 = [k for k in range(B-K+1, B+1)]
    res = set(nums1 + nums2)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
num = [i for i in range(A, B+1)]
res = set(num[:K] + num[-1:-K-1:-1])
result = res
for i in result:
    print(i)

Submission status: Wrong Answer

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

res = []

for a in range(A,min(A + K,B)):
    res.append(a)
for b in range(max(A,B - K + 1),B + 1):
    res.append(b)

print(sorted(list(set(res))))

Submission status: Wrong Answer

Solution code:
A,B,K=map(int,input().split())
l=[]
if 2*K>=B-A:
    for i in range(A,B+1):
        print(i)
else:
    for i in range(K):
        print(i+A)
    for i in range(K):
        print(B-K+1+i)

Submission status: Wrong Answer

Solution code:
A,B,K=map(int,input().split())
l=[]
for i in range(A,B+1):
    l.append(i)
if 2*K>=len(l):
    for i in l:
        print(i)
else:

    for i in l[0:K]:
        print(i)
    for i in l[B-A-1:B+1]:
        print(i)
    #for i in l[:-1]

Submission status: Wrong Answer

Solution code:
A,B,K=map(int,input().split())
l=[]
for i in range(A,B+1):
    l.append(i)
print(l)
if 2*K>=len(l):
    for i in l:
        print(i)
else:

    for i in l[0:K]:
        print(i)
    for i in l[B-A-1:B+1]:
        print(i)
    #for i in l[:-1]

Submission status: Wrong Answer

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

ans = []

for i in range(a,min(a+k,b+1)):
    ans.append(i)
for i in range(b,b-a+k-1,-1):
    ans.append(i)

ans = list(set(ans))
ans.sort()
for i in ans:
    print(i)

Submission status: Wrong Answer

Solution code:
a,b,K = map(int,input().split())
List =[]
for i in range(a,b+1):
    List.append(i)
ans = []

ans=(List[:K])
for i in ans:
    print(i)
ans=(List[b-a+1-K:len(List)])
for i in ans:
    print(i)

Submission status: Wrong Answer

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

small = set(i for i in range(a,a+k) if i<b)
big = set(i for i in range(b-k+1,b+1) if i>a)

ans = small | big
for item in sorted(ans):
  print(item)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,k = map(int, input().split())
res = []
if 2*k > b-a:
    k = math.ceil((b-a)/2)
for i in range(k):
    res.append(a+i)
    res.append(b-i)

for s in sorted(set(res)):
    print(s)

Submission status: Wrong Answer

Solution code:
a,b,k = map(int, input().split())
res = []
if 2*k > b-a:
    k = (b-a)//2
for i in range(k):
    res.append(a+i)
    res.append(b-i)

for s in sorted(set(res)):
    print(s)

Submission status: Wrong Answer

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

for s in sorted(set(res)):
    print(s)

Submission status: Wrong Answer

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

for s in sorted(set(res)):
    print(s)

Submission status: Wrong Answer

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

if b-a+1 >= k:
    l = [i for i in range(a, b + 1)]
    ans = (sorted(l[:k] + l[-k:]))
elif b-a+1 <= k:
    ans = [i for i in range(a, b + 1)]

for i in ans:
    print(i)

Submission status: Wrong Answer

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

if b-a+1 >= k:
    l = [i for i in range(a, b + 1)]
    ans = (sorted(l[:k] + l[-1:-k-1:-1]))
elif b-a+1 <= k:
    ans = [i for i in range(a, b + 1)]

for i in ans:
    print(i)

Submission status: Wrong Answer

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

if b-a >= k:
    l = [i for i in range(a, b + 1)]
    ans = (sorted(l[:k] + l[-1:-k-1:-1]))
else:
    ans = [i for i in range(a, b + 1)]

for i in ans:
    print(i)

Submission status: Wrong Answer

Solution code:
A,B,K = map(int,input().split())
l = set()
if K < B:
 for i in range(K):
    l.add(A+i)
 for j in range(K):
    l.add(B-j)
 list = list(l)
 list.sort()
 for i in range(len(list)):
    print(list[i])
else:
    for i in range(A,B+1):
        print(i)

Submission status: Wrong Answer

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

a,b,k = map(int,input().split())
lists = []

for i in range(a,a+k):
    lists.append(i)

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

l = set(lists)
m = list(l)

m.sort()

for i in m:
    print(i)

Submission status: Wrong Answer

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

a,b,k = map(int,input().split())
list = []

for i in range(a,a+k):
    list.append(i)

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

list.sort()

l = set(list)

for i in l:
    print(i)

Submission status: Wrong Answer

Solution code:
A,B,K = map(int,input().split())
l = set()
for i in range(K):
    l.add(A+i)
for j in range(K):
    l.add(B-j)
list = list(l)
list.sort()
for i in range(len(list)):
    print(list[i])

Submission status: Wrong Answer

Solution code:
a,b,k=map(int,input().split())
m=[]
for i in range(a,min(a+k,b+1)):
    m.append(i)
for i in range(max(b+k+1,a),b+1):
    m.append(i)
l=set(m)
ll=list(l)
lll=sorted(ll)
for i in range(len(lll)):
    print(lll[i])

Submission status: Wrong Answer

Solution code:
a,b,k=map(int,input().split())
m=[]
for i in range(a,a+k):
    m.append(i)
for i in range(b-k+1,b+1):
    m.append(i)
l=set(m)
ll=list(l)
lll=sorted(ll)
for i in range(len(lll)):
    print(lll[i])

Submission status: Wrong Answer

Solution code:
a,b,k=map(int,input().split())
m=[]
for i in range(a,a+k):
    m.append(i)
for i in range(b-k+1,b+1):
    m.append(i)
l=set(m)
sorted(l)
ll=list(l)
for i in range(len(ll)):
    print(ll[i])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def print_all(a, b):
    for i in range(a-1, b):
        print(i + 1)

a, b, k = map(int, input().split())
elem = b - a + 1

if elem <= k:
    print_all(a, b)

elif elem / 2 > int(elem / 2):
    print_all(a, b)

else:
    for i in range(k):
        print(a + i)

    for i in range(k):
        print(b - k + 1 + i)

Submission status: Wrong Answer

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

ans = []
for i in range(k):
    if a+i <= b:
        ans.append(a+i)
for j in range(k):
    if a <= b-k+j and b-k+j not in ans:
        ans.append(b-k+j)

ans2 = sorted(ans)
for n in ans2:
    print(n)

Submission status: Wrong Answer

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

ans = []
for i in range(k):
    if a+i <= b:
        ans.append(a+i)
for j in range(k):
    if a <= b-k+j and b-k+j not in ans:
        ans.append(b-k+j)

print(sorted(ans))

Submission status: Wrong Answer

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

for i in range(k):
    print(a+i)
for j in range(k):
    print(b-k)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in set(select):
    print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a+k < 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())
x = set()
for i in range(A, A+K):
  x.add(i)
for i in range(B-K+1, B+1):
  x.add(i)
for xx in sorted(x):
  print(xx)

Submission status: Wrong Answer

Solution code:
A,B,K = map(int,input().split())
nums = [i for i in range(A,B+1)]
anss = []
anss.extend(nums[:K])
anss.extend(nums[-K:])
anss.sort()
anss = set(anss)
for i in anss:
    print(i)

Submission status: Wrong Answer

Solution code:
A,B,K = map(int,input().split())
nums = [i for i in range(A,B+1)]
anss = []
anss.extend(nums[:K])
anss.extend(nums[-K:])
anss.sort()
for i in anss:
    print(i)

Submission status: Wrong Answer

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

if(K <= A-B+1):
 for i in range(A,A+K):
   ans.append(i)
 for j in range(B-K+1,B+1):
   ans.append(j)
 ans = set(ans)
 ans = list(ans)
 ans.sort()
 for i in range(len(ans)):
   print(ans[i])
  
else:
  for i in range(A,B+1):
    print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,K = map(int,input().split())
ls = list(range(A,min(B,A+K)+1))
[print(i) for i in sorted(list(set(ls[:K]) and set(ls[-K:])))]

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, k = map(int, input().split())
ans = []
if 2 * k >= b - a:
	for i in range(a, b + 1):
		print(i)
	exit()
for i in range(a, a + k):
	ans.append(i)
for i in range(b - k + 1, b + 1):
	ans.append(i)
ans.sort()
for i in range(len(ans)):
	print(ans[i])

Submission status: Wrong Answer

Solution code:
# https://atcoder.jp/contests/abc093/tasks/abc093_b

import itertools
import collections
import bisect

def main():
    A, B, K = map(int, input().split())
    ans = []
    for i in range(K):
        ans.append(A + i)
    for i in range(K):
        ans.append(B - i)

    list(set(ans)).sort()
    for a in ans:
        print(a)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a,b,k=map(int,input().split())
if b-a<=2*k:
    for i in range(a,b+1):print(i)
else:
    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:
import sys

def main():
  input = sys.stdin.readline
  A, B, K = map(int, input().split())
  i = 0
  while i < K:
    a, b = A + i, B - i
    i += 1
    if a == b:
      print(a)
      break
    elif a > b:
      break
    else:
      print(a)
      print(b)


if __name__ == '__main__':
  main()

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())
for i in range(a, a+k):
    print(i)
for i in range(b-k, b):
    print(i)

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
L = []
for a in range(A, min(A + K, B)):
    L.append(a)
for b in range(max(B - K + 1, A + 1), B + 1):
    if b not in L:
        L.append(b)
for l in L:
    print(l)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

st=a
while st<=a+k-1 :
    print(st)
    st+=1
st=max(st,b-k+1)
while st<=b :
    print(st)
    st+=1

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a, b, k = map(int, input().split())
li = []
for i in range(a, a + k):
    if b < i:
        break
    li.append(i)
for i in range(b - k, b + 1):
    if i < a:
        continue
    li.append(i)
li = list(set(li))
for num in li:
    print(num)

Submission status: Wrong Answer

Solution code:
a,b,c=sorted(map(int,input().split()))
print(c-b+(b-a+1)//2+((b-a)&1))

Submission status: Wrong Answer

Solution code:
a,b,k=map(int,input().split())
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(a,b+1):
  exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s = set()
for i in range(a, a + k):
    s.add(i)

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

e = list(s)
e.sort()
for i in e:
    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 j in range(b-k+1, b+1):
    print(j)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    A,B,K = map(int, lines.pop(0).split(' '))
    NLIST = set()
    for i in range(K):
        NLIST.add(A+i)
        NLIST.add(B-i)

    NLIST = list(NLIST)
    NLIST.sort()
    for i in NLIST:
        print(i)

                #
# main
#
lines = [x.strip() for x in sys.stdin.readlines()]

                                                  #
# solve !!
#
solve(lines)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,k=map(int,input().split())
a_m = b if a+k >= b else a+k
b_m = a if b-k <= a else b-k
la=list(range(a,a_m))
lb=list(range(b,b_m,-1))
for i in sorted(set(la+lb)):
  print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,k=map(int,input().split())
atmp=a; btmp=b;
ans=set()

for i in range(1,k+1):
    ans.add(atmp)
    atmp+=1
    if atmp>b:
        break

for i in range(1,k+1):
    ans.add(btmp)
    btmp-=1
    if btmp<a:
        break

print(sorted(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s = set()

for i in range(A, min(A + K, B)):
    s.add(i)

for i in range(B, max(A, B - K), -1):
    s.add(i)

s = sorted(s)

for i in s:
    print(i)

Submission status: Wrong Answer

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

s = set()

for i in range(A, A + K):
    s.add(i)

for i in range(B, B - K, -1):
    s.add(i)

s = sorted(s)

for i in s:
    print(i)

Submission status: Wrong Answer

Solution code:
a, b, k = map(int, input().split())
l = [i for i in range(a, a+k)] + [i for i in range(b-k+1, b+1)]
for i in sorted(set(l), key=l.index):
  print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, k = map(int, input().split())
l = [i for i in range(a, b)] 
l = set(l[:k-1] + l[-k:])
for i in l:
  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,b+1):
        print(i)
    exit(0)
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:
def main():
    A, B, K = map(int, input().split())
    if B - A > K + 1:
        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)


main()

Submission status: Wrong Answer

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


main()

Submission status: Wrong Answer

Solution code:
# ABC093B
a,b,k = map(int,input().split())
xx =[]
for x in range(a,a+k):
    if x>b:
        break
    xx.append(x)
for x in range(b+1-k,b+1):
    if x<a:
        break
    xx.append(x)
for x in list(set(xx)):
    print(x)

Submission status: Wrong Answer

Solution code:
# ABC093B
a,b,k = map(int,input().split())
for x in range(a,a+k):
    print(x)
for x in range(b+1-k,b+1):
    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(0,k):
    print(b-i)

Submission status: Wrong Answer

Solution code:
import sys
A,B,K = map(int,input().split())
sum = []
if B <= K:
    for i in range(A,B+1):
        if i > A+K or B-K < i:
            print(i)
    else:
        sys.exit(0)


for i in range(A,A+K): #AからB
    sum.append(i)

for i in range(B-K-1,B+1):
    sum.append(i)

sum = list(set(sum))
sum.sort()
[print(i) for i in sum]

Submission status: Wrong Answer

Solution code:
import sys
A,B,K = map(int,input().split())
sum = []
if B < K:
    for i in range(A,B+1):
        if i > A+K or B-K < i:
            print(i)
    else:
        sys.exit(0)


for i in range(A,A+K): #AからB
    sum.append(i)

for i in range(B-K+1,B+1):
    sum.append(i)

sum = list(set(sum))
sum.sort()
[print(i) for i in sum]

Submission status: Wrong Answer

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

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

else:
    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,c=map(int,input().split())
list=[]
if(a==b):
    print(a)
if(b-a<c):
    c=b-a
for i in range(c):
    list.append(a+i)
    list.append(b-i)
list=sorted(set(list))
print(list)
for j in range(len(list)):
    print(list[j])

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
list=[]
list.append(a)
list.append(b)
if(a==b):
    print(a)
if(b-a<c):
    c=b-a
for i in range(c):
    list.append(a+i)
    list.append(b-i)
list=sorted(set(list))
for j in range(len(list)):
    print(list[j])

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
list=[]
list.append(a)
list.append(b)
for i in range(c-1):
    a+=1
    b+=-1
    list.append(a)
    list.append(b)
list=sorted(set(list))
for j in range(len(list)):
    print(list[j])

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
v=set([])
if b-a<c:
    c=b-a
for i in range(c):
    v.add(a+i)
    v.add(b-i)
l=list(v)
l.sort()
for i in range(len(l)):
    print(l[i])

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
ret = []
for i in range(A, A + K):
    if i <= B:
        ret.append(i)
for i in range(B - K + 1, B + 1):
    if i >= A:
        ret.append(i)
for r in list(set(ret)):
    print(r)

Submission status: Wrong Answer

Solution code:
a,b,k=[int(x) for x in input().split()]
print(a,b,k)#
ans = []
for i in range(k):
  if a+i<=b:ans.append(a+i)
  if b-i>=a:ans.append(b-i)
#print(ans)#
ans = list(set(ans))
ans.sort()
for e in ans: print(e)

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,b):
  print(i)

Submission status: Wrong Answer

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

  if int(n-A)<K or int(B-n)<K:
    print(n)
  n += 1
  if n==B:
    break

Submission status: Wrong Answer

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

    ans = set()

    for i in range(k):
        x = a + i
        if x <= b:
            ans.add(x)

        y = b - i
        if a <= y:
            ans.add(y)

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


def main2():
    a, b, k = map(int, input().split())
    ans = []
    if 2 * k < b - a + 1:
        for i in range(k):
            ans.append(a + i)
            ans.append(b - i)
    else:
        for i in range(a, b + 1):
            ans.append(i)

    for i in ans:
        print(i)



if __name__ == '__main__':
    main2()

Submission status: Wrong Answer

Solution code:
A, B, K = map(int, input().split())
ans = []
for i in range(K):
  ans.append(A + i)
for i in range(1,K+1):
  if B-(K-i) not in ans:
    ans.append(B-(K-i))
for x in ans:
  print(x)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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