Buggy python submission (verdict: Runtime Error):
import numpy as np

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

C = np.arange(A,B+1)

if len(C)>2*K:
    for i in range(A, A+K):
        print(i)
    for i in range(B-K+1,B+1):
        print(i)

else:
    for i in range(A,B+1):
        print(i)
        
        



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

L = B - A + 1

if L >= 2*K:
    for i in range(A, A+K):
        print(i)
    for i in range(B-K+1,B+1):
        print(i)
        
else:
    for i in range(A,B+1):
        print(i)

Buggy python submission (verdict: Runtime Error):
import numpy as np

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

C = np.arange(A,B+1)

if len(C)<2*K:
    for x in range(len(C)):
        print(C[x])
        
        
else:
    for y in range(K):
        print(C[y])
    for z in range(len(C)-K,len(C)):
        print(C[z])


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

L = B - A + 1

if L >= 2*K:
    for i in range(A, A+K):
        print(i)
    for i in range(B-K+1,B+1):
        print(i)
        
else:
    for i in range(A,B+1):
        print(i)

Buggy python submission (verdict: Runtime Error):
import numpy as np

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

C = np.arange(A,B+1)

if len(C)<2*K:
    for x in range(len(C)):
        print(C[x])
        
        
else:
    for y in range(K):
        print(C[y])
    for z in range(B-K-2,B-2):
        print(C[z])


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

L = B - A + 1

if L >= 2*K:
    for i in range(A, A+K):
        print(i)
    for i in range(B-K+1,B+1):
        print(i)
        
else:
    for i in range(A,B+1):
        print(i)

Buggy python submission (verdict: Runtime Error):
import numpy as np

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

C = np.arange(A,B+1)

if len(C)<=K:
    for x in range(len(C)):
        print(C[x])

        
elif len(C)<2*K:
    for y in range(K):
        print(C[y])
    for z in range(B-K-2,B-3):
        print(C[z])
        
        
else:
    for y in range(K):
        print(C[y])
    for z in range(B-K-2,B-2):
        print(C[z])


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

L = B - A + 1

if L >= 2*K:
    for i in range(A, A+K):
        print(i)
    for i in range(B-K+1,B+1):
        print(i)
        
else:
    for i in range(A,B+1):
        print(i)

Buggy python submission (verdict: Runtime Error):
import numpy as np

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

C = np.arange(A,B+1)

if max(C)<=K:
    for x in range(B):
        print(C[x])

        
else:
    for y in range(K):
        print(C[y])
    for z in range(B-K-2,B-2):
        print(C[z])


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

L = B - A + 1

if L >= 2*K:
    for i in range(A, A+K):
        print(i)
    for i in range(B-K+1,B+1):
        print(i)
        
else:
    for i in range(A,B+1):
        print(i)

Buggy python submission (verdict: Runtime Error):
import numpy as np

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

C = np.arange(A,B+1)

if max(C)<=K:
    for x in range(B):
        print(C[x])

        
else:
    for y in range(K):
        print(C[y])
    for z in range(B-K-2,B):
        print(C[z])


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

L = B - A + 1

if L >= 2*K:
    for i in range(A, A+K):
        print(i)
    for i in range(B-K+1,B+1):
        print(i)
        
else:
    for i in range(A,B+1):
        print(i)

Buggy python submission (verdict: Runtime Error):
import numpy as np

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

C = np.arange(A,B+1)

E=C[B-K-2:]


if max(C)<=K:
    for x in range(B):
        print(C[x])


        
else:
    for y in range(K):
        print(C[y])
    for z in range(B-K-2,B):
        print(C[z])


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

L = B - A + 1

if L >= 2*K:
    for i in range(A, A+K):
        print(i)
    for i in range(B-K+1,B+1):
        print(i)
        
else:
    for i in range(A,B+1):
        print(i)

Buggy python submission (verdict: Runtime Error):
import numpy as np

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

C = np.arange(A,B+1)

print(C)

E=C[B-K-2:]


if max(C)<=K:
    for x in range(B):
        print(C[x])


        
else:
    for y in range(K):
        print(C[y])
    for z in range(B-K-2,B):
        print(C[z])


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

L = B - A + 1

if L >= 2*K:
    for i in range(A, A+K):
        print(i)
    for i in range(B-K+1,B+1):
        print(i)
        
else:
    for i in range(A,B+1):
        print(i)