Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
mozi=input()
if mozi == a or mozi == i or mozi == u or mozi == e or mozi == o:
   print('vowel')
else:
   print('consonant')


Fixed submission:
mozi=input()
if mozi == 'a' or mozi == 'i' or mozi == 'u' or mozi == 'e' or mozi == 'o':
   print('vowel')
else:
   print('consonant')

Buggy python submission (verdict: Runtime Error):
mozi=input()
if mozi == a or mozi == i or mozi == u or mozi == e or mozi == o:
   print("vowel")
else:
   print("consonant")

Fixed submission:
mozi=input()
if mozi == 'a' or mozi == 'i' or mozi == 'u' or mozi == 'e' or mozi == 'o':
   print('vowel')
else:
   print('consonant')
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
if a == b + c or b == lc + a or c == a + b:
  print('Yes')
else:
  print('No')


Fixed submission:
l = map(int,raw_input().split())
if l[0] == l[1] + l[2] or l[1] == l[0] + l[2] or l[2] == l[0] + l[1]:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
l = map(int, input().split())
if l[0] == l[1] + l[2] or l[1] == l[0] + l[2] or l[2] == l[0] + l[1]:
  print('Yes')
else:
  print('No')


Fixed submission:
l = map(int,raw_input().split())
if l[0] == l[1] + l[2] or l[1] == l[0] + l[2] or l[2] == l[0] + l[1]:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
l = map(int, input().split())
if l[0] == l[1] + l[2] or l[1] == l[0] + l[2] or l[2] == l[0] + l[1]:
  print('Yes')
else:
  print('No')

Fixed submission:
l = map(int,raw_input().split())
if l[0] == l[1] + l[2] or l[1] == l[0] + l[2] or l[2] == l[0] + l[1]:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
l = map(int, raw_input().split())
if l[0] == l[1] + l[2] or l[1] == l[0] + l[2] or l[2] == l[0] + l[1]:
  print('Yes')
else:
  print('No')

Fixed submission:
l = map(int,raw_input().split())
if l[0] == l[1] + l[2] or l[1] == l[0] + l[2] or l[2] == l[0] + l[1]:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
a = []
for i in range(3):
   a.append(input())
print((a[0] + a[1]) * a[2] / 2)

Fixed submission:
a = []
for i in range(3):
   a.append(input())
print((a[0] + a[1]) * a[2] / 2)
Buggy python submission (verdict: Runtime Error):
a = input()
print(a * (a + 1)/2)

Fixed submission:
a = input()
print(a * (a + 1)/2)
Buggy python submission (verdict: Runtime Error):
# C
# Typical Stairs

N_M = input()

N = int(N_M.split(" ")[0])
M = int(N_M.split(" ")[1])

a = []

for i in range(M):

    a.append(int(input()))

#print(a)

import numpy as np

stairs = list(np.zeros(N + 1))

if 1 in a:

    stairs[1] = 0
    stairs[2] = 1

elif 2 in a:

    stairs[1] = 1
    stairs[2] = 0

elif 1 in a and 2 in a:

    stairs[1] = 0
    stairs[2] = 0

else:

    stairs[1] = 1
    stairs[2] = 2

for i in range(N + 1):
    
    if i in a:

        stairs[i] = 0
    
    elif i > 2:

        stairs[i] = int(stairs[i - 1] + stairs[i - 2])

    #print(stairs)

print(stairs[-1] % 1000000007)

Fixed submission:
# A
# Airplane

P_Q_R = input()

P = int(P_Q_R.split(" ")[0])
Q = int(P_Q_R.split(" ")[1])
R = int(P_Q_R.split(" ")[2])

PQR =[P, Q, R]

import numpy as np

print(np.sum(PQR) - np.max(PQR))
Buggy python submission (verdict: Runtime Error):
a,b=input().split()
if a*b % 2 == 0:
  print('Even')
else:
  print('Odd')

Fixed submission:
a,b=map(int, input().split())
if a*b % 2 == 0:
  print('Even')
else:
  print('Odd')
Buggy python submission (verdict: Runtime Error):
prev_t = 0
prev_x = 0
prev_y = 0

n = int(input())
for _ in range(n):
  t, x, y = map(int, input().split())
  dist = (x - prev_x) + (y - prev_y)
  time = t - prev_t
  if dist != time:
    ans = False
    break
  
  prev_x = x
  prev_y = y
  prev_t = t
    
if not ans:
  print('No')
else:
  print('Yes')
  



Fixed submission:
prev_t = 0
prev_x = 0
prev_y = 0

n = int(input())
ans = True
for _ in range(n):
    t, x, y = map(int, input().split())
    dist = (x - prev_x) + (y - prev_y)
    time = t - prev_t
    if dist > time or dist % 2 != time % 2:
        ans = False
        break

    prev_x = x
    prev_y = y
    prev_t = t

if not ans:
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
# input
n, m = map(int, input().split())
persons = []
checks = []
for i in range(n):
    point = tuple(map(int, input().split()))
    persons.append(point)
for i in range(m):
    point = tuple(map(int, input().split()))
    checks.append(point)

# print(persons)
# print(checks)
    
def get_distance(person, check):
    return abs(person[0] - check[0]) + abs(person[1] - check[1])
    
for i in range(n):
    min_distance = 10 ** 10
    min_distance_point_num = -1

    # calculate min distance from n to each m
    for j in range(m):
        distance = get_distance(persons[i], checks[j])
        if distance < min_distance:
            min_distance = distance
            min_distance_point_num = j + 1

    print(min_distance_point_num)


Fixed submission:
#!/usr/bin/env python3
a, b = map(int, input().split())
print((a+b) % 24)

Buggy python submission (verdict: Runtime Error):
#!/usr/bin/evn python3
# input
n, m = map(int, input().split())
persons = []
checks = []
for i in range(n):
    point = tuple(map(int, input().split()))
    persons.append(point)
for i in range(m):
    point = tuple(map(int, input().split()))
    checks.append(point)

# print(persons)
# print(checks)
    
def get_distance(person, check):
    return abs(person[0] - check[0]) + abs(person[1] - check[1])
    
for i in range(n):
    min_distance = 10 ** 10
    min_distance_point_num = -1

    # calculate min distance from n to each m
    for j in range(m):
        distance = get_distance(persons[i], checks[j])
        if distance < min_distance:
            min_distance = distance
            min_distance_point_num = j + 1

    print(min_distance_point_num)


Fixed submission:
#!/usr/bin/env python3
a, b = map(int, input().split())
print((a+b) % 24)
Buggy python submission (verdict: Runtime Error):
s_num, c_num = map(int, input().split())
if s_num * 2 > c_num:
    print(s_num)
else:
    ans = s_num
    c_num -= s_num * 2
    ans += c_num // 4
    print(ans)
    


Fixed submission:
#!/usr/bin/env python3
n = int(input())
x = n * 800
y = (n // 15) * 200
ans = x - y
print(ans)
Buggy python submission (verdict: Runtime Error):
N, X = map(int, input().split())
A = list(map(int, input().split()))
cnt = 0
ans = 0
for i in A:
  ans += i
  if ans <= X:
    cnt += 1    
print(cnt)


Fixed submission:
X, A = map(int, input().split())
if X < A:
  print(0)
else:
  print(10)
Buggy python submission (verdict: Runtime Error):
a = int(input())
_ = int(input())
_ = int(input())
_ = int(input())
e = int(input())
k = int(input())

if e - a =< k:
  print("Yay!")
else:
  print(":(")



Fixed submission:
a = int(input())
_ = int(input())
_ = int(input())
_ = int(input())
e = int(input())
k = int(input())

if e - a <= k:
  print("Yay!")
else:
  print(":(")
Buggy python submission (verdict: Runtime Error):
l = []
for i in range(5):
  l.append(input())

ans = 0
if int(l[0][-1]) <= int(l[1][-1]):
  min_val = l[0]
  ans += (-(-int(l[1])//10))*10
else:
  min_val = l[1]
  ans += (-(-int(l[0])//10))*10
  
for i in range(2, 5):
  if min_val[-1] <= int(l[i][-1]):
    ans += (-(-int(l[i])//10))*10
  else:
    ans += (-(-min_val//10))*10
    min_val = l[i]
    
ans += (-(-min_val//10))*10
print(ans)

Fixed submission:
l = []
for i in range(5):
  l.append(input())

ans = 0
min_val = 99
flag = False

for i in range(5):
  if l[i][-1] == "0":
    ans += int(l[i])
  else:
    if int(l[i][-1]) <= int(str(min_val)[-1]):
      if flag:
        ans += (-(-int(min_val)//10))*10
      flag = True
      min_val = l[i]
    else:
      ans += (-(-int(l[i])//10))*10
if flag:
  ans += int(min_val)
print(ans)
Buggy python submission (verdict: Runtime Error):
N, Q = map(int, input().split())
data = input()
result = [0] * N
for i in range(N-1):
  if data[i] == "A" and data[i+1]:
    result[i+1] = result[i] + 1
  else:
    result[i+1] = result[i

for i in range(Q):
  l, r = map(int, input().split())
  print(result[r-1]-result[l-1])


Fixed submission:
b = input()

if b == "A":
  print("T")
elif b == "T":
  print("A")
elif b == "C":
  print("G")
elif b == "G":
  print("C")
Buggy python submission (verdict: Runtime Error):
ans = 0
count = 0


for i in S:
    if i =="A" or i == "C" or i == "T" or i == "G":
        count += 1
    else:
        ans = max(count, ans)
        count = 0
        
ans = max(count, ans)
print(ans)

Fixed submission:
S = input()
ans = 0
count = 0


for i in S:
    if i =="A" or i == "C" or i == "T" or i == "G":
        count += 1
    else:
        ans = max(count, ans)
        count = 0
        
ans = max(count, ans)
print(ans)
Buggy python submission (verdict: Runtime Error):
N, Q = map(int, input().split())
data = input()
result = [0] * N
for i in range(N-1):
  if data[i] == "A" and data[i+1]:
    result[i+1] = result[i] + 1
  else:
    result[i+1] = result[i

for i in range(Q):
  l, r = map(int, input().split())
  print(result[r-1]-result[l-1])


Fixed submission:
N, Q = map(int, input().split())
data = input()
result = [0] * N
for i in range(N-1):
  if data[i] == "A" and data[i+1] == "C":
    result[i+1] = result[i] + 1
  else:
    result[i+1] = result[i]

for i in range(Q):
  l, r = map(int, input().split())
  print(result[r-1]-result[l-1])

Buggy python submission (verdict: Time Limit Exceeded):
N, Q = map(int, input().split())
data = input()
for i in range(Q):
  l, r = map(int, input().split())
  print(data[l-1:r].count("AC"))

Fixed submission:
N, Q = map(int, input().split())
data = input()
result = [0] * N
for i in range(N-1):
  if data[i] == "A" and data[i+1] == "C":
    result[i+1] = result[i] + 1
  else:
    result[i+1] = result[i]

for i in range(Q):
  l, r = map(int, input().split())
  print(result[r-1]-result[l-1])

Buggy python submission (verdict: Time Limit Exceeded):
N, Q = map(int, input().split())
S = input()

for count in range(Q):
    l, r = map(int, input().split())
    count = 0

    for i in range(len(S[l-1: r])-1):

        if S[l-1 + i: l-1 + i +2 ] == "AC":    
            count += 1
    print(count)



Fixed submission:
N, Q = map(int, input().split())
data = input()
result = [0] * N
for i in range(N-1):
  if data[i] == "A" and data[i+1] == "C":
    result[i+1] = result[i] + 1
  else:
    result[i+1] = result[i]

for i in range(Q):
  l, r = map(int, input().split())
  print(result[r-1]-result[l-1])

Buggy python submission (verdict: Runtime Error):
N, Q = map(int, input().split())
S = input()

for count in range(3):
    l, r = map(int, input().split())
    ans = 0
    count = 0

    for i in S[l-1: r]:
        if i =="A" or i == "T":    
            count += 1
        else:
            ans = max(count, ans)
            count = 0
    ans = max(count, ans)
    print(ans)




Fixed submission:
N, Q = map(int, input().split())
data = input()
result = [0] * N
for i in range(N-1):
  if data[i] == "A" and data[i+1] == "C":
    result[i+1] = result[i] + 1
  else:
    result[i+1] = result[i]

for i in range(Q):
  l, r = map(int, input().split())
  print(result[r-1]-result[l-1])
Buggy python submission (verdict: Runtime Error):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
cnt = 0
for i in range(M):
  A = list(map(int, input().split()))
  tmp = 0
  for j in range(N):
    tmp += A[j]*B[j]
  tmp += C
  if tmp > 0:
    cnt += 1
    
print(cnt)
               

Fixed submission:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
cnt = 0
for i in range(N):
  A = list(map(int, input().split()))
  tmp = 0
  for j in range(M):
    tmp += A[j]*B[j]
  tmp += C
  if tmp > 0:
    cnt += 1
    
print(cnt)
Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
num = max(A, B)
a = [1]
cnt = 1
for i in range(1,num):
  if A % i == 0 and B % i == 0:
    cnt += 1
    a.append(i)
a.sort(reverse=True)
print(a[K])



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

print(min(B//A, C))
Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
l = []
for i in range(1, max(A, B)):
  if A % i == 0 and B % i == 0:
    l.append(i)
    
l.sort(reverse=True)
print(l[K-1])

Fixed submission:
A, B, K = map(int, input().split())
l = []
for i in range(1, max(A, B)+1):
  if A % i == 0 and B % i == 0:
    l.append(i)
    
l.sort(reverse=True)
print(l[K-1])

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
num = max(A, B)
a = []
cnt = 0
for i in range(1,num):
  if A%i == 0 and B % i == 0:
    cnt += 1
    a.append(i)

print(a[cnt-K])



Fixed submission:
A, B, K = map(int, input().split())
l = []
for i in range(1, max(A, B)+1):
  if A % i == 0 and B % i == 0:
    l.append(i)
    
l.sort(reverse=True)
print(l[K-1])
Buggy python submission (verdict: Runtime Error):
N = int(input())
life_list = list(map(int, input().split()))
life_list.sort()
while life_list[1] - life_list[0] > 0:
    if life_list[1] == life_list[0]:
        break
	life_list[1] = life_list[1] - life_list[0]
    life_list.sort()
        
print(life_list[0])



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

if B % A == 0:
    print(A+B)
else:
    print(B-A)
Buggy python submission (verdict: Runtime Error):
N = int(input())
life_list = list(map(int, input().split()))
life_list.sort()
while life_list[1] - life_list[0] > 0:
    if life_list[1] == life_list[0]:
        break
	life_list[1] = life_list[1] - life_list[0]
    life_list.sort()
        
print(life_list[0])



Fixed submission:
from fractions import gcd
N = int(input())
life_list = list(map(int, input().split()))
ans = life_list[0]
for A in life_list:
  ans = gcd(ans, A)
        
print(ans)
Buggy python submission (verdict: Runtime Error):
data = []
for i in range(3):
    data.append(list(map(int, input().split())))
data = sum(data, [])

for i in data:
    result[i-1]+=1
if 3 in result:
    print("NO")
else:
    print("YES")

Fixed submission:
data = []

for i in range(3):
    data.append(list(map(int, input().split())))
data = sum(data, [])

result = [0]*4
for i in data:
    result[i-1]+=1
if 3 in result:
    print("NO")
else:
    print("YES")
Buggy python submission (verdict: Runtime Error):
s = input()
l = []

while flag=False:
  if tmp in l:
    flag = True
  else:
    if s % 2 == 0:
      tmp = s / 2
      l.append(tmp)
      s = tmp
    else:
      tmp = 3*s +1
      l.append(tmp)
      s = tmp
      
l.sort()
print(l[-2])

Fixed submission:
s = int(input())
l = []
flag = False
cnt = 0
tmp = 0
while flag==False:
  if tmp in l:
    cnt += 1
    flag = True
  else:
    if s % 2 == 0:
      tmp = s / 2
      l.append(s)
      s = tmp
      cnt += 1
    else:
      tmp = 3*s +1
      l.append(s)
      s = tmp
      cnt += 1
      
print(cnt)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = int(input())
B = int(input())

print('Hello World' if N == 1 else A+B )

Fixed submission:
N = int(input())

if N==1:
    print('Hello World')
else:
    
    A = int(input())
    B = int(input())

    print(A+B )
Buggy python submission (verdict: Runtime Error):
N = int(input())
ans = 0
if N < 105:
  pass
else:
  for i in range(105, N+1, 2):
    cnt = 0
    for j in range(1, N+1):
      if i % j == 0:
        cnt += 1
    if cnt == 8:
      ans += 1
      
print(ans)  



Fixed submission:
A, B = map(int, input().split())
print((A-1)*(B-1))
Buggy python submission (verdict: Runtime Error):
N = int(input())
ans = 0
if N < 105:
  pass
else:
  for i in range(1, N+1):
    cnt = 0
    for j in range(1, N+1):
	    if j % i == 0:
          cnt += 1
    if cnt == 8:
      ans += 1
      
print(ans)  

Fixed submission:
N = int(input())
ans = 0
if N < 105:
  pass
else:
  for i in range(105, N+1, 2):
    cnt = 0
    for j in range(1, N+1):
      if i % j == 0:
        cnt += 1
    if cnt == 8:
      ans += 1
      
print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()

for _ in range(len(s)):
    if s = t:
        print('Yes')
        exit()
    s = s[-1]+s[:-1]
print('No')

Fixed submission:
s = input()
t = input()

for _ in range(len(s)):
    if s == t:
        print('Yes')
        exit()
    s = s[-1]+s[:-1]
print('No')
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))

for i in range(N):
    A[i] -= i+1

A.sort()
print(A)
median = A[N//2]

for i in range(N):
    A[i] -= median
    A[i] = abs(A[i])
print(sum(A))

Fixed submission:
N = int(input())
print(N if N%2 == 0 else N*2)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))

for i in range(N):
    A[i] -= i+1

A.sort()
print(A)
if N % 2 == 0:
    median = A[N//2]
else:
    median = A[(N + 1)//2]

for i in range(N):
    A[i] -= median
print(sum(A))

Fixed submission:
N = int(input())
A = list(map(int, input().split()))

for i in range(N):
    A[i] -= i+1

A.sort()
median = A[N//2]

for i in range(N):
    A[i] -= median
    A[i] = abs(A[i])
print(sum(A))
Buggy python submission (verdict: Runtime Error):
# https://atcoder.jp/contests/abc098/submissions/5418660
N = int(input())
S = input()
ans = 0
moji = 'abcdefghijklmnopqrstuvwxyz'
for i in range(1, N):
  l, r = S[:i], S[i:]
  cnt = 0
  for c in moji:
    if c in l an c in r:
      cnt += 1
  ans = max(ans, cnt)
  
print(ans)

Fixed submission:
# https://atcoder.jp/contests/abc098/submissions/5418660
N = int(input())
S = input()
ans = 0
moji = 'abcdefghijklmnopqrstuvwxyz'
for i in range(1, N):
  l, r = S[:i], S[i:]
  cnt = 0
  for c in moji:
    if c in l and c in r:
      cnt += 1
  ans = max(ans, cnt)
  
print(ans)
Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input().split())
K = int(input())

ans = A + B + C - max(A, B, C) * (K - 1) *2
  
print(int(ans))


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

if a <= b:
  print(a)
else:
  print(a-1)

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

if a < b:
  print(a)
else:
  print(a-1)

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

if a <= b:
  print(a)
else:
  print(a-1)
Buggy python submission (verdict: Runtime Error):
N, X = map(int, input().split())
A = []
for i in range(N):
  A.append(int(input())
A.sort()
ans = N
X -= sum(A)
ans += X//A[0]
print(ans)

Fixed submission:
N, X = map(int, input().split())
A = []
for i in range(N):
  A.append(int(input()))
A.sort()
ans = N
X -= sum(A)
ans += X//A[0]
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a1=input().split()
tag_list=()
dic={}
for i in a1:
    tag_list.append(int(i))
 
for j in range(0,n):
    numnum=tag_list[j]
    if numnum in dic:
        print(dic[numnum])
    else:
        A=list(tag_list)
        A.pop(j)
        A.sort()
        num=int(n/2-1)
        print(A[num])
        dic[numnum]=A[num]

Fixed submission:
l = input().split()
if int(l[0])+int(l[1])>=int(l[2]) and int(l[0])<=int(l[2]):
    print('YES')
else:
    print('NO')

Buggy python submission (verdict: Runtime Error):
n=int(input())
a1=input().split()
tag_list=[]
for i in a1:
    tag_list.append(int(i))

for j in range(0,n):
    numnum=tag_list[j]
    if numnum in dic:
        print(dic[numnum])
    else:
        A=tag_list[0:j]
        test=tag_list[j+1:n]
        A.extend(test)
        A.sort()
        num=int(n/2-1)
        print(A[num])
        dic[numnum]=A[num]


Fixed submission:
l = input().split()
if int(l[0])+int(l[1])>=int(l[2]) and int(l[0])<=int(l[2]):
    print('YES')
else:
    print('NO')

Buggy python submission (verdict: Runtime Error):
l = map(int, raw_input().split())
if l[0]+l[1]<l[2]:
    print('YES')
else:
    print('NO')

Fixed submission:
l = input().split()
if int(l[0])+int(l[1])>=int(l[2]) and int(l[0])<=int(l[2]):
    print('YES')
else:
    print('NO')
Buggy python submission (verdict: Runtime Error):
x,y,z=[int(i) for i in input().split()]
S=list(range(x,y+1))
if x<z and z<y:
    S.pop(z-x)
for num in S:
    print(num)

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

for i in range(A, min(B, A+K)):
  l.append(i)
for i in range(max(A, B-K+1), B+1):
  l.append(i)

l = list(set(l))
l.sort()
for i in l:
  print(i)

Buggy python submission (verdict: Runtime Error):
x,y,z=[int(i) for i in input().split()]
S=list(range(x,y+1))

if x<z:
    for j in range(0,min(z-x,y-x+1)):
        print(S[j])
if z<y:
    for j in range(max(z-x+1,x),y-x+1):
        print(S[j])

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

for i in range(A, min(B, A+K)):
  l.append(i)
for i in range(max(A, B-K+1), B+1):
  l.append(i)

l = list(set(l))
l.sort()
for i in l:
  print(i)

Buggy python submission (verdict: Runtime Error):
x,y,z=[int(i) for i in input().split()]
S=list(range(x,y+1))

if x<z:
    for j in range(0,z-x):
        print(S[j])
if z<y:
    for j in range(z-x+1,y-x+1):
        print(S[j])

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

for i in range(A, min(B, A+K)):
  l.append(i)
for i in range(max(A, B-K+1), B+1):
  l.append(i)

l = list(set(l))
l.sort()
for i in l:
  print(i)

Buggy python submission (verdict: Runtime Error):
x,y,z=map(int,input().split())
S=list(range(x,y+1))

if x<z:
    for j in range(0,z-x):
        print(S[j])
if z<y:
    for j in range(z-x+1,y-x+1):
        print(S[j])

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

for i in range(A, min(B, A+K)):
  l.append(i)
for i in range(max(A, B-K+1), B+1):
  l.append(i)

l = list(set(l))
l.sort()
for i in l:
  print(i)
Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input())

if (A+B) > C:
  print("Yes")
else:
  print("No")

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

if (A+B) >= C:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
b = []
r = []
_all = []
for i in range(N):
  b.append(input())
  _all.append(input())
N = int(input())
for i in range(N):
  r.append(input())
  _all.append(input())
_all = list(set(_all))
ans = 0
for i in _all:
  ans = max(ans, b.count(i)-r.count(i))
print(ans)

Fixed submission:
N = int(input())
b = []
r = []
all_l = []
for i in range(N):
  tmp = input()
  b.append(tmp)
  all_l.append(tmp)
N = int(input())
for i in range(N):
  tmp = input()
  r.append(tmp)
  all_l.append(tmp)
all_l = list(set(all_l))
ans = 0
for i in all_l:
  ans = max(ans, b.count(i)-r.count(i))
print(ans)
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
cnt = 0
for i in range(A, B+1):
  tmp = str(i)
  if tmp[0] == tmp[-1] and tmp[1] == tmp[3]:
    cnt += 1
print(cnt)


Fixed submission:
A=input()
B=input()
C=input()

print(A[0]+B[1]+C[-1])
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = list(map(int, input()))

a.sort(reverse=True)
alice = a[0::2]
bob = a[1::2]

alice = sum(alice)
bob = sum(bob)
print(alice - bob)

Fixed submission:
N = int(input())
a = list(map(int, input().split()))

a.sort(reverse=True)
alice = a[0::2]
bob = a[1::2]

alice = sum(alice)
bob = sum(bob)
print(alice - bob)
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(input())
X = int(input())
cnt = 0

for i in range(A+1):
  for j in range(B+1):
    for k in range(C+1):
      if 500*i + 100*j + 50*k == X:
        cnt += 1
ans(cnt)

Fixed submission:
A = int(input())
B = int(input())
C = int(input())
X = int(input())
cnt = 0

for i in range(A+1):
  for j in range(B+1):
    for k in range(C+1):
      if 500*i + 100*j + 50*k == X:
        cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
S=input()

S[3]="8"
print(S)

Fixed submission:
a=input().split('/')
a[0]=int(a[0])+1

print(str(a[0])+'/'+a[1]+'/'+a[2])
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
S = input()

if S[A] == "-" and S.count("-") == 1:
  print("Yes")
else:
  print("No")

Fixed submission:
a=input()
print(48-int(a))

Buggy python submission (verdict: Runtime Error):
l = input().split()
a=input()

b=a.split("-")


if len(b[0]) == l[0] and len(b[1])==l[1] and and len(b)<3:
    print('YES')
else:
    print('NO')


Fixed submission:
a=input()
print(48-int(a))

Buggy python submission (verdict: Runtime Error):
a=raw_input()
print(48-int(a))

Fixed submission:
a=input()
print(48-int(a))