Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int,input().split())
src = [i for i in range(a,b+1)]
re = sorted(src, reverse=True)
if k > len(src):
    k = len(src)
li = set()
for ki in range(k):
    li.add(src[ki])
    li.add(re[ki])
for l in sorted(li):
    print(l)

Fixed submission:
a,b,k = map(int,input().split())
if k > b-a+1:
    k = b-a+1
li = set()
for i in range(k):
    li.add(a+i)
    li.add(b-i)
for l in sorted(li):
    print(l)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int,input().split())
src = [i for i in range(a,b+1)]
re = sorted(src, reverse=True)
if k > len(src):
    k = len(src)
li = []
for ki in range(k):
    li.append(src[ki])
    li.append(re[ki])
for l in sorted(set(li)):
    print(l)

Fixed submission:
a,b,k = map(int,input().split())
if k > b-a+1:
    k = b-a+1
li = set()
for i in range(k):
    li.add(a+i)
    li.add(b-i)
for l in sorted(li):
    print(l)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int,input().split())
src = [i for i in range(a,b+1)]
re = sorted(src, reverse=True)
if k > len(src):
    k = len(src)
li = []
for ki in range(k):
    li.append(src[ki])
    li.append(re[ki])
for l in sorted(set(li)):
    print(l)

Fixed submission:
a,b,k = map(int,input().split())
if k > b-a+1:
    k = b-a+1
li = set()
for i in range(k):
    li.add(a+i)
    li.add(b-i)
for l in sorted(li):
    print(l)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int,input().split())
src = [i for i in range(a,b+1)]
if k > len(src):
    k = len(src)
li = []
for ki in range(k):
    li.append(src[ki])
for ki in reversed(range(k)):
    li.append(src[-(ki+1)])
for l in sorted(set(li)):
    print(l)

Fixed submission:
a,b,k = map(int,input().split())
if k > b-a+1:
    k = b-a+1
li = set()
for i in range(k):
    li.add(a+i)
    li.add(b-i)
for l in sorted(li):
    print(l)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int,input().split())
src = [i for i in range(a,b+1)]
if k > len(src):
    k = len(src)
li = set()
for ki in range(k):
    li.add(src[ki])
for ki in reversed(range(k)):
    li.add(src[-(ki+1)])
for l in sorted(li):
    print(l)

Fixed submission:
a,b,k = map(int,input().split())
if k > b-a+1:
    k = b-a+1
li = set()
for i in range(k):
    li.add(a+i)
    li.add(b-i)
for l in sorted(li):
    print(l)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int,input().split())
src = [i for i in range(a,b+1)]
if k > len(src):
    k = len(src)
li = []
for ki in range(k):
    li.append(src[ki])
for ki in reversed(range(k)):
    li.append(src[-(ki+1)])
for l in sorted(set(li)):
    print(l)

Fixed submission:
a,b,k = map(int,input().split())
if k > b-a+1:
    k = b-a+1
li = set()
for i in range(k):
    li.add(a+i)
    li.add(b-i)
for l in sorted(li):
    print(l)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int,input().split())
src = [i for i in range(a,b+1)]
if k > len(src):
    k = len(src)
li = []
for ki in range(k):
    li.append(src[ki])
for ki in reversed(range(k)):
    li.append(src[-(ki+1)])
for l in sorted(set(li)):
    print(l)

Fixed submission:
a,b,k = map(int,input().split())
if k > b-a+1:
    k = b-a+1
li = set()
for i in range(k):
    li.add(a+i)
    li.add(b-i)
for l in sorted(li):
    print(l)