Buggy python submission (verdict: Time Limit Exceeded):
A, B, K = map(int, input().split())
ab = [int(i) for i in range(A, B + 1)]
ba = ab[::-1]
ans = set()

for i in range(min(K, len(ab))):
    ans.add(ab[i])
    ans.add(ba[i])

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

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

if b-a+1 <= 2*k:
    for num in range(a, b+1):
        print(num)
else:
    for num in range(a, a+k):
        print(num)
    for num in range(b-k+1,b+1):
        print(num)

Buggy python submission (verdict: Time Limit Exceeded):
A, B, K = map(int, input().split())
ab = [int(i) for i in range(A, B + 1)]
ba = sorted(ab, reverse=True)
ans = []

for i in range(min(K, len(ab))):
    ans.append(ab[i])
    ans.append(ba[i])

ans = sorted(set(ans))
for i in ans:
    print(i)

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

if b-a+1 <= 2*k:
    for num in range(a, b+1):
        print(num)
else:
    for num in range(a, a+k):
        print(num)
    for num in range(b-k+1,b+1):
        print(num)

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
ab = [int(i) for i in range(A, B + 1)]
ba = sorted(ab, reverse=True)
ans = []

for i in range(K):
    ans.append(ab[i])
    ans.append(ba[i])

ans = sorted(set(ans))
for i in ans:
    print(i)

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

if b-a+1 <= 2*k:
    for num in range(a, b+1):
        print(num)
else:
    for num in range(a, a+k):
        print(num)
    for num in range(b-k+1,b+1):
        print(num)

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
AB = list(range(A, B+1))
 
for i in sorted(set(AB[:K]) | set(AB[-K:])):
    print(i)

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

if b-a+1 <= 2*k:
    for num in range(a, b+1):
        print(num)
else:
    for num in range(a, a+k):
        print(num)
    for num in range(b-k+1,b+1):
        print(num)

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
AB = list(range(A, B+1))
ans = set(AB[:K]) | set(AB[-K:])
 
for i in sorted(ans):
    print(i)

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

if b-a+1 <= 2*k:
    for num in range(a, b+1):
        print(num)
else:
    for num in range(a, a+k):
        print(num)
    for num in range(b-k+1,b+1):
        print(num)

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
AB = list(range(A, B+1))
ans = sorted(set(AB[:K]) | set(AB[-K:]))
 
for i in ans:
    print(i)

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

if b-a+1 <= 2*k:
    for num in range(a, b+1):
        print(num)
else:
    for num in range(a, a+k):
        print(num)
    for num in range(b-k+1,b+1):
        print(num)

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
AB = list(range(A, B+1))
ans = sorted(set(AB[K:]) | set(AB[:-K]))
 
for i in ans:
    print(i)

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

if b-a+1 <= 2*k:
    for num in range(a, b+1):
        print(num)
else:
    for num in range(a, a+k):
        print(num)
    for num in range(b-k+1,b+1):
        print(num)

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
AB = list(range(A, B+1))
ans = []
if len(AB[:K]) >= 1 and len(AB[-K:]) >= 1 :
    ans = sorted(set(AB[:K]+AB[-K:]))

elif len(AB[:K]) >= 1:
    ans = sorted(AB[:K])
elif len(AB[-K]) >= 1:
    ans = sorted(AB[:-K])
    
if len(ans)>=1:
    for i in ans:
        print(i)

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

if b-a+1 <= 2*k:
    for num in range(a, b+1):
        print(num)
else:
    for num in range(a, a+k):
        print(num)
    for num in range(b-k+1,b+1):
        print(num)

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
AB = list(range(A, B+1))
ans = sorted(set(AB[:K]+AB[-K:]))
 
if len(ans) >= 1:
    for i in ans:
        print(i)

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

if b-a+1 <= 2*k:
    for num in range(a, b+1):
        print(num)
else:
    for num in range(a, a+k):
        print(num)
    for num in range(b-k+1,b+1):
        print(num)

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
AB = list(range(A, B+1))


ans = set(AB[:K]+AB[-K:])

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

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

if b-a+1 <= 2*k:
    for num in range(a, b+1):
        print(num)
else:
    for num in range(a, a+k):
        print(num)
    for num in range(b-k+1,b+1):
        print(num)

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
AB = list(range(A, B+1))
ans = sorted(set(AB[:K]+AB[-K:]))

for i in ans:
    print(i)

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

if b-a+1 <= 2*k:
    for num in range(a, b+1):
        print(num)
else:
    for num in range(a, a+k):
        print(num)
    for num in range(b-k+1,b+1):
        print(num)

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
AB = list(range(A, B+1))
ans = sorted(set(AB[:K]+AB[-K:]))

for i in ans:
    print(i)

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

if b-a+1 <= 2*k:
    for num in range(a, b+1):
        print(num)
else:
    for num in range(a, a+k):
        print(num)
    for num in range(b-k+1,b+1):
        print(num)

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
AB = list(range(A, B+1))
for i in AB[:K]:
    print(i)
for i in AB[-K:]:
    print(i)

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

if b-a+1 <= 2*k:
    for num in range(a, b+1):
        print(num)
else:
    for num in range(a, a+k):
        print(num)
    for num in range(b-k+1,b+1):
        print(num)