Buggy python submission (verdict: Time Limit Exceeded):
a,b,k=map(int,input().split())
if k>b-a:
    for i in range(a,b+1):
        print(i)
else:
    l=[]
    s=set()
    for i in range(a,b+1):
        l.append(i)
    for i in range(k):
        s.add(l[i])
        s.add(l[-i-1])
    s_l=list(s)
    s_l.sort()
    for i in range(len(s_l)):
        print(s_l[i])

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

ans=list(range(a,min(a+k,b)))+list(range(max(a,b-k+1),b+1))
ans=set(ans)
ans=list(ans)
ans.sort()
for i in range(len(ans)):
    print(ans[i])

Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())

s=set()
l=[]

for i in range(a,b+1):
    l.append(i)

for i in range(k):
    s.add(l[i])
    s.add(l[-i-1])
    
s_l=list(s)
s_l.sort()
for i in range(len(s_l)):
    print(s_l[i])

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

ans=list(range(a,min(a+k,b)))+list(range(max(a,b-k+1),b+1))
ans=set(ans)
ans=list(ans)
ans.sort()
for i in range(len(ans)):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
a,b,k=map(int, input().split())

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

else:
    
    l1=[i for i in range(a,b+1)] 
    l2=[]
    for i in range(k):
        l2.append(l1[i])
    for i in range(b-a-k+1,b-a+1):
        l2.append(l1[i])

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

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

ans=list(range(a,min(a+k,b)))+list(range(max(a,b-k+1),b+1))
ans=set(ans)
ans=list(ans)
ans.sort()
for i in range(len(ans)):
    print(ans[i])

Buggy python submission (verdict: Runtime Error):
a,b,k=map(int, input().split())

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

else:
    
    l1=[i for i in range(a,b+1)] 
    l2=[]
    for i in range(k):
        l2.append(l1[i])
    for i in range(b-a-k+1,b-a+1):
        l2.append(l1[i])

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

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

ans=list(range(a,min(a+k,b)))+list(range(max(a,b-k+1),b+1))
ans=set(ans)
ans=list(ans)
ans.sort()
for i in range(len(ans)):
    print(ans[i])

Buggy python submission (verdict: Runtime Error):
a,b,k=map(int, input().split())

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

else:
    l1=[i for i in range(a,b+1)] 
    l2=[]
    for i in range(k):
        l2.append(l1[i])
    for i in range(b-a-k+1,b-a+1):
        l2.append(l1[i])

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

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

ans=list(range(a,min(a+k,b)))+list(range(max(a,b-k+1),b+1))
ans=set(ans)
ans=list(ans)
ans.sort()
for i in range(len(ans)):
    print(ans[i])

Buggy python submission (verdict: Runtime Error):
a,b,k=map(int, input().split())
if k>b:
    k=b-1

l1=[i for i in range(a,b+1)] 
l2=[]
for i in range(k):
    l2.append(l1[i])
for i in range(b-a-k+1,b-a+1):
    l2.append(l2[i])

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

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

ans=list(range(a,min(a+k,b)))+list(range(max(a,b-k+1),b+1))
ans=set(ans)
ans=list(ans)
ans.sort()
for i in range(len(ans)):
    print(ans[i])

Buggy python submission (verdict: Runtime Error):
a,b,k=map(int, input().split())
if k>b:
    k=b-1

l=[i for i in range(a,b+1)] 
set_l=set()
for i in range(k):
    set_l.add(l[i])
for i in range(b-a-k+1,b-a+1):
    set_l.add(l[i])

l_set = list(set_l)
l_set.sort()
for i in range(len(l_set)):
    print(l_set[i])

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

ans=list(range(a,min(a+k,b)))+list(range(max(a,b-k+1),b+1))
ans=set(ans)
ans=list(ans)
ans.sort()
for i in range(len(ans)):
    print(ans[i])