Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque
 
A, B, K = map(int, input().split())
 
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))
num.sort()
for i in range(len(num)):
    print(num[i])

Fixed submission:
A, B, K = map(int, input().split())

value = []

if B - A < K or 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])

Buggy python submission (verdict: Runtime Error):
A, B, K = input().split()

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

value = []
if A == B:
    value = A
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])

Fixed submission:
A, B, K = map(int, input().split())

value = []

if B - A < K or 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])

Buggy python submission (verdict: Runtime Error):
from collections import deque

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

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

Fixed submission:
A, B, K = map(int, input().split())

value = []

if B - A < K or 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])

Buggy python submission (verdict: Time Limit Exceeded):
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))
num.sort()
for i in range(len(num)):
    print(num[i])

Fixed submission:
A, B, K = map(int, input().split())

value = []

if B - A < K or 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])

Buggy python submission (verdict: Runtime Error):
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)).sort()

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

Fixed submission:
A, B, K = map(int, input().split())

value = []

if B - A < K or 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])

Buggy python submission (verdict: Time Limit Exceeded):
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()

for i in range(len(value)):
    if value[i] not in num:
        num.append(value[i])
        print(value[i])

Fixed submission:
A, B, K = map(int, input().split())

value = []

if B - A < K or 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])

Buggy python submission (verdict: Runtime Error):
from collections import deque

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

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

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

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

num = deque()

for i in range(len(value)):
    if value[i] not in num:
        num.append(value[i])
        print(value[i])

Fixed submission:
A, B, K = map(int, input().split())

value = []

if B - A < K or 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])

Buggy python submission (verdict: Time Limit Exceeded):
A, B, K = input().split()

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

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

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

num = []

for i in range(len(value)):
    if value[i] not in num:
        num.append(value[i])
        print(value[i])

Fixed submission:
A, B, K = map(int, input().split())

value = []

if B - A < K or 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])

Buggy python submission (verdict: Runtime Error):
from collections import deque

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

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

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

for i in range(K):
    if s[i] not in value:
        value.append(s[i])

for i in range(len(s)-K, len(s)):
    if s[i] not in value:
        value.append(s[i])

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

Fixed submission:
A, B, K = map(int, input().split())

value = []

if B - A < K or 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])