Buggy python submission (verdict: Runtime Error):
A,B,K = map(int,input().split()
            
ans = []
            
for i in range(K):
  if A+i <=B:
    ans.append(A+i)
  if B-i >= A:
    ans.append(B-i)
            
            
ans = sorted(lis(set(ans)))
print(*ans,sep="\n")
          

Fixed submission:
A,B,K = map(int,input().split())
            
ans=[]
            
for i in range(K):
  if A+i <=B:
    ans.append(A+i)
  if B-i >= A:
    ans.append(B-i)
            
            
ans = sorted(list(set(ans)))
print(*ans,sep="\n")

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

x =list(range(a,b+1))
ans =[]

if  len(x) >=k:
  print(sorted("\n".join(map(str,x))))
  exit()

else:
  for i in range(k):
    if len(x) > i:
      if not(x[i] in ans):
        ans.append(x[i])
      if not(x[-(1+i)] in ans):
        ans.append(x[-(1+i)])
  
  ans.sort()

s = "\n".join(map(str,ans))
print(s)

Fixed submission:
A,B,K = map(int,input().split())
            
ans=[]
            
for i in range(K):
  if A+i <=B:
    ans.append(A+i)
  if B-i >= A:
    ans.append(B-i)
            
            
ans = sorted(list(set(ans)))
print(*ans,sep="\n")

Buggy python submission (verdict: Runtime Error):
ans =[]

if  len(x) >=k:
  print("\n".join(map(str,x)))
  exit()

else:
  for i in range(k):
    if len(x) > i:
      if not(x[i] in ans):
        ans.append(x[i])
      if not(x[-(1+i)] in ans):
        ans.append(x[-(1+i)])
  
  ans.sort()

s = "\n".join(map(str,ans))
print(s)



Fixed submission:
A,B,K = map(int,input().split())
            
ans=[]
            
for i in range(K):
  if A+i <=B:
    ans.append(A+i)
  if B-i >= A:
    ans.append(B-i)
            
            
ans = sorted(list(set(ans)))
print(*ans,sep="\n")

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

x =list(range(a,b+1))
ans =[]

if  len(x) >=i:
  print("\n".join(map(str,x)))
  exit()

else:
  for i in range(k):
    if len(x) > i:
      if not(x[i] in ans):
        ans.append(x[i])
      if not(x[-(1+i)] in ans):
        ans.append(x[-(1+i)])
  
  ans.sort()

s = "\n".join(map(str,ans))
print(s)



Fixed submission:
A,B,K = map(int,input().split())
            
ans=[]
            
for i in range(K):
  if A+i <=B:
    ans.append(A+i)
  if B-i >= A:
    ans.append(B-i)
            
            
ans = sorted(list(set(ans)))
print(*ans,sep="\n")

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

x =list(range(a,b+1))
ans =[]

for i in range(k):
  if len(x) >= i:
    if not(x[i] in ans):
      ans.append(x[i])
    if not(x[-(1+i)] in ans):
      ans.append(x[-(1+i)])
  
ans.sort()

s = "\n".join(map(str,ans))
print(s)



Fixed submission:
A,B,K = map(int,input().split())
            
ans=[]
            
for i in range(K):
  if A+i <=B:
    ans.append(A+i)
  if B-i >= A:
    ans.append(B-i)
            
            
ans = sorted(list(set(ans)))
print(*ans,sep="\n")

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

x =list(range(a,b+1))
ans =[]

for i in range(k):
  if len(x) > i:
    if not(x[i] in ans):
      ans.append(x[i])
    if not(x[-(1+i)] in ans):
      ans.append(x[-(1+i)])
  
ans.sort()



s = "\n".join(map(str,ans))
print(s)

Fixed submission:
A,B,K = map(int,input().split())
            
ans=[]
            
for i in range(K):
  if A+i <=B:
    ans.append(A+i)
  if B-i >= A:
    ans.append(B-i)
            
            
ans = sorted(list(set(ans)))
print(*ans,sep="\n")

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

x =list(range(a,b+1))
ans =[]

for i in range(k):
  if len(x) > i:
    ans.append(x[i])
    ans.append(x[-(1+i)])
  
  
ans.sort()
ans2 =set(ans)


s = "\n".join(map(str,ans2))
print(s)

Fixed submission:
A,B,K = map(int,input().split())
            
ans=[]
            
for i in range(K):
  if A+i <=B:
    ans.append(A+i)
  if B-i >= A:
    ans.append(B-i)
            
            
ans = sorted(list(set(ans)))
print(*ans,sep="\n")

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

x =list(range(a,b+1))
ans =[]

for i in range(k):
  if len(x) > i:
    ans.append(x[i])
    ans.append(x[-(1+i)])
  
  
ans.sort()
ans2 =set(ans)


print(ans2)

Fixed submission:
A,B,K = map(int,input().split())
            
ans=[]
            
for i in range(K):
  if A+i <=B:
    ans.append(A+i)
  if B-i >= A:
    ans.append(B-i)
            
            
ans = sorted(list(set(ans)))
print(*ans,sep="\n")

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

x =list(range(a,b+1))
ans =[]

for i in range(k):
  ans.append(x[i])
  ans.append(x[-(1+i)])
  
  
ans.sort()


print(ans)

Fixed submission:
A,B,K = map(int,input().split())
            
ans=[]
            
for i in range(K):
  if A+i <=B:
    ans.append(A+i)
  if B-i >= A:
    ans.append(B-i)
            
            
ans = sorted(list(set(ans)))
print(*ans,sep="\n")

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

x =[a:b+1]
ans =[]

for i in range(k):
  ans.append(x[i])
  ans.append(x[-(1+i)])
  
  
ans.sort()

print("".joint(ans))

Fixed submission:
A,B,K = map(int,input().split())
            
ans=[]
            
for i in range(K):
  if A+i <=B:
    ans.append(A+i)
  if B-i >= A:
    ans.append(B-i)
            
            
ans = sorted(list(set(ans)))
print(*ans,sep="\n")