Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
f = open('input.txt', 'r')
sys.stdin = f

N, M = map(int, input().split())
As = list(map(int, input().split()))
d = sum(As)
if N < d:
    print(-1)
else:
    print(N-d)


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

d = sum(A)

if N < d:
  print(-1)
else:
  print(N-d)

Buggy python submission (verdict: Runtime Error):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
f = open('input.txt', 'r')
sys.stdin = f

N, M = map(int, input().split())
As = list(map(int, input().split()))
d = sum(As)
if N < d:
    print(-1)
else:
    print(N-d) 


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

d = sum(A)

if N < d:
  print(-1)
else:
  print(N-d)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()
c = 0
for i in range(N-2):
    for j in range(i+1, N-1):
        if S[i] == S[j]:
            continue
        for k in range(j + 1, N):
            if S[i] == S[k]:
                continue
            if S[j] == S[k]:
                continue
            if j-i == k-j:
                continue
            c += 1
print(c)

Fixed submission:
N = int(input())
S = input()
Rc = 0
Gc = 0
Bc = 0
for i in range(N):
    if S[i] == 'R':
         Rc +=1
    elif S[i] == 'G':
         Gc+=1
    elif S[i] == 'B':
         Bc+=1
c = Rc*Gc*Bc

for i in range(N-2):
     for j in range(i+1,N-1):
          if S[i] == S[j]:
               continue
          if j + j - i >= N:
               continue
          if S[i] == S[j+j-i]:
               continue
          if S[j] == S[j+j-i]:
               continue
          c -= 1
print(c)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
count = [0] * N
for i in range(N):
  count[A[i] - 1]  += 1
  
nanimo = 0 
for i in range(N):
  nanimo += count[i] * (count[i] - 1) // 2
for i in range(N):
  tekito = count[A[i] - 1]
  if tekito == 1:
    s = nanimo
  else:
    s = nanimo -  ((tekito * (tekito - 1) //2) - ((tekito - 1) * (tekito - 2) //2))
  print(s)


Fixed submission:
N, M = map(int, input().split())
gu = N * (N-1) //2
ki = M * (M-1) // 2
print(gu + ki)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
count = [0] * N
#answer = [-1] * N
#p = [0] * N
for i in range(N):
  count[i]  = A.count(i + 1)
  
nanimo = 0 
for i in range(N):
  nanimo += count[i] * (count[i] - 1) // 2
for i in range(N):
  tekito = count[A[i] - 1]
  if tekito == 2:
    s = nanimo - 1
  elif tekito == 1:
    s = nanimo
  else:
    s = nanimo -  ((tekito * (tekito - 1) //2) - ((tekito - 1) * (tekito - 2) //2))
  print(s)


Fixed submission:
N, M = map(int, input().split())
gu = N * (N-1) //2
ki = M * (M-1) // 2
print(gu + ki)
Buggy python submission (verdict: Runtime Error):
w, h = x,y = map(int,input().split())

if w * h % 2 == 0:
  print(w * h // 2)
else:
  print(w * h // 2 + 1)

Fixed submission:
w, h = map(int,input().split())
 
if w == 1 or h == 1:
  print(1)
  exit()
  
if (w * h) % 2 == 0:
  print(w * h // 2)
else:    
  a = w // 2 + 1
  s = a * (h // 2 + 1)
  b = w // 2
  s2 = b * (h //2)
  print(s + s2)
Buggy python submission (verdict: Runtime Error):
N = int(input())

if N == 1:
  print('a')
elif N == 2:
  print('aa')
  print('ab')
elif N == 3:
  print('aaa')
  print('aab')
  print('aba')
  print('abb')
  print('abc')

Fixed submission:
a,b,c = map(int,input().split())
print('Yes' if 4*a*b < (c-a-b)**2 and c-a-b > 0 else 'No')

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

if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
  print(Yes)
else:
  print(No)



Fixed submission:
a,b,c = map(int,input().split())
print('Yes' if 4*a*b < (c-a-b)**2 and c-a-b > 0 else 'No')
Buggy python submission (verdict: Runtime Error):
import math
N = int(input())
X = list(map(int,input().split()))
med = int(sum(X)/N + 0.5)
c = 0
for i in range(N):
  c += (X[i] - med)**2
print(c)


Fixed submission:
n,r = map(int, input().split())
 
if n >= 10:
  print(r)
else:
  print(r + 100 * (10-n))

Buggy python submission (verdict: Runtime Error):
n,r = map(int, input.split())
 
if n >= 10:
  print(r)
else:
  print(r + 100 * (10-n)) 

Fixed submission:
n,r = map(int, input().split())
 
if n >= 10:
  print(r)
else:
  print(r + 100 * (10-n))

Buggy python submission (verdict: Runtime Error):
n,r = map(int, input.split())

if n >= 10:
  print(r)
else:
  print(n + 100 * (10-r)) 


Fixed submission:
n,r = map(int, input().split())
 
if n >= 10:
  print(r)
else:
  print(r + 100 * (10-n))

Buggy python submission (verdict: Runtime Error):
n, r = map(int, input().split())
if n >= 10:
  print(r)
else
  print(n + 100 * (10-r)) 

Fixed submission:
n,r = map(int, input().split())
 
if n >= 10:
  print(r)
else:
  print(r + 100 * (10-n))
Buggy python submission (verdict: Runtime Error):
n,k = map(int, input().split())

for i in range(1,10):
  if n <= k ** i:
    print(i +1)
    sys.exit()

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

for i in range(1,50):
  if n < k ** i:
    print(i)
    break
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = list(map(int, input()))
r = 'APPROVED'
for i in range(N):
  if a[i] % 2 ==0:
    if a[i] % 3 != 0 and a[i] % 5 != 0:
      r = 'DENIED'
      break
print(r)

Fixed submission:
N = int(input())
a = list(map(int, input().split()))
r = 'APPROVED'
for i in range(N):
  if a[i] % 2 ==0:
    if a[i] % 3 != 0 and a[i] % 5 != 0:
      r = 'DENIED'
      break
print(r)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
Ss = []
c = []
for i in range(N):
  s = input()
  if s in Ss:
    c[Ss.index(s)] += 1
  else:
    Ss.append(s)
    c.append(1)
mostPoll = max(c)
winners = []
for i in range(len(c)):
  if c[i] == mostPoll:
    winners.append(Ss[i])
winners.sort()
for s in winners:
  print(s)

Fixed submission:
n = int(input())
d = {}
for _ in range(n) :
    s = input()
    if s in d :
        d[s] += 1
    else :
        d[s] = 1

mx = max(d.values())
for s in sorted(k for k in d if d[k] == mx) :
    print(s)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
ss = [input() for i in range(N)]
setss = set(ss)
maxes = [0]*len(setss)
listsetss = list(setss)
for i in range(len(setss)):
  maxes[i] = ss.count(listsetss[i])
mostPoll = max(maxes)
winners = []
for i in range(len(maxes)):
  if maxes[i] == mostPoll:
    winners.append(listsetss[i])
winners.sort()

for s in winners:
  print(s)

Fixed submission:
n = int(input())
d = {}
for _ in range(n) :
    s = input()
    if s in d :
        d[s] += 1
    else :
        d[s] = 1

mx = max(d.values())
for s in sorted(k for k in d if d[k] == mx) :
    print(s)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
l = []
c = []
for i in range(N):
  s = input()
  try:
    index = l.index(s)
    c[index] += 1
  except:
    l.append(s)
    c.append(1)
m = max(c)
n = []
for i in range(len(c)):
  if c[i] == m:
    n.append(l[i])

n.sort()
for g in n:
  print(g)
    
  

Fixed submission:
n = int(input())
d = {}
for _ in range(n) :
    s = input()
    if s in d :
        d[s] += 1
    else :
        d[s] = 1

mx = max(d.values())
for s in sorted(k for k in d if d[k] == mx) :
    print(s)
Buggy python submission (verdict: Runtime Error):
s, t = input().split()
a, b = map(int, input().split())
u = input()

if s = u :
  a -= 1
else:
  b -= 1
print(a, b)


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

if s == u :
  a -= 1
else:
  b -= 1
print(a, b)
Buggy python submission (verdict: Runtime Error):
s = input()

for i in len(s):
  print(x, '')

Fixed submission:
s = input()
a = '' 
for i in range(len(s)):
  a = a + 'x'

print(a)
Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int,input().split())
ps = list(map(int,input().split()))
su = 0
ind = 0
for i in range(N-K+1):
    ksum = sum(ps[i:i + K])
    if ksum > su:
        ind = i
        su = ksum
ki = 0

for i in range(ind, ind+K):
    ki += (ps[i]*(ps[i]+1))/2/ps[i]
print(ki)





Fixed submission:
N,K = map(int,input().split())
ps = list(map(int,input().split()))
su = sum(ps[0:K])
ksum = su
ind = 0
for i in range(1,N-K+1):
    ksum -= ps[i-1]
    ksum += ps[i+K-1]
    if ksum > su:
        ind = i
        su = ksum
ki = 0

for i in range(ind, ind+K):
    ki += (ps[i]*(ps[i]+1))/2/ps[i]
print(ki)
Buggy python submission (verdict: Runtime Error):
import math
H, A map(int, input().split())

print(math.ceil(H / A))

Fixed submission:
import math
H, A = map(int, input().split())
 
print(math.ceil(H / A))
Buggy python submission (verdict: Runtime Error):
A, gomi = map(int, input().split())
print('Yes' if A <= list(map(int,input().split())) else 'No')

Fixed submission:
A, gomi = map(int, input().split())
print('Yes' if A <= sum(list(map(int,input().split()))) else 'No')

Buggy python submission (verdict: Runtime Error):
A, gomi = int(input().split())
print('Yes' if A <= list(map(int,input().split())) else 'No')

Fixed submission:
A, gomi = map(int, input().split())
print('Yes' if A <= sum(list(map(int,input().split()))) else 'No')
Buggy python submission (verdict: Time Limit Exceeded):
zettaiTLE = int(input())
M = [zettaiTLE]                
cnt = 0
while True:
  if M[0] == 1:
    del M[0]
    if len(M) == 0:
      cnt += 1
      print(cnt)
      exit()
  else :
    tekito = M[0]
    del M[0]
    for i in range(2):
      M.append(tekito // 2)
  cnt += 1

Fixed submission:
H = int(input())
m = 1
cnt = 0
if H == 1:
  print(1)
  exit()
while True:
  if H < m:
    print(m  - 1)
    exit()
  m *= 2
  cnt += 1
Buggy python submission (verdict: Runtime Error):
N = int(input())
P = list(map(int,input().split()))
count = 1
 
if N > 0:
  min = P[0]
  
for i in range(1, N): 
  if min >= P[i]:
    min = P[i]
    count += 1      
print(count)

Fixed submission:
N, M = input().split()
 
if N==M:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = list(map(int,input().split()))
count = 1

for i in range(1, N):
  isbreak = False
  for j in range(0,i):
    if (P[i] > P[j]):
      isbreak = True
      break
  if isbreak == False:
    count += 1
    
print(count)
  

Fixed submission:
N = int(input())
P = list(map(int,input().split()))
count = 1
 
if N > 0:
  min = P[0]
  
for i in range(1, N):
  isbreak = False
  
  if min < P[i]:
    continue
  elif min >= P[i]:
    min = P[i]
    count += 1
    continue  
  for j in range(0,i):
    if (P[i] > P[j]):
      isbreak = True
      break
  if isbreak == False:
    count += 1
    
print(count)
Buggy python submission (verdict: Runtime Error):
l = ['abcdefghijklmnopqrstuvwxyz']

print(l[l.index(input()) + 1])

Fixed submission:
c =input()
l = 'abcdefghijklmnopqrstuvwxyz'
 
print(l[l.index(c) + 1])
Buggy python submission (verdict: Runtime Error):
N = int(input())
P = tuple(map(int,input().split()))
Q = tuple(map(int,input().split()))
ls = [i for i in range(1,N+1)]
A = list(permutations(ls))
 
print(abs(A.index(P) - A.index(Q)))

Fixed submission:
import itertools
N = int(input())
P = tuple(map(int,input().split()))
Q = tuple(map(int,input().split()))
ls = [i for i in range(1,N+1)]
A = list(itertools.permutations(ls))
 
print(abs(A.index(P) - A.index(Q)))
Buggy python submission (verdict: Runtime Error):
N, A, B = map(int, input().split())
if (A - B) % 2 == 0 :
  print (abs(A - B) // 2)
else:
  print(min(max(A, B) - 1, N - min(A, B))

Fixed submission:
N, A, B = map(int, input().split())
if abs(A - B) % 2 == 0:
  print (abs(A - B) // 2)
else:
  hajiniyoru = min(min(A - 1, B - 1), min(N - A, N - B))
  print(hajiniyoru  + 1 + (abs(A - B) - 1) // 2)
Buggy python submission (verdict: Runtime Error):
l = [1,2,3]
for i range (2):
  l.remove(int(input()))
print(l[0])
  

Fixed submission:
l = [1,2,3]
for i in range (2):
  l.remove(int(input()))
print(l[0])
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input.split())

if a + b + c <= 21:
  print('win')
else:
  print('bust')
  
        
        

Fixed submission:
a, b, c = map(int, input().split())
 
if a + b + c <= 21:
  print('win')
else:
  print('bust')
Buggy python submission (verdict: Runtime Error):
S = input()

cnt = 0
for i in range(S // 2):
  if S[i] != S[len(S) - 1 - i]:
    cnt +=0
print(cnt)
  
  

Fixed submission:
S = input()
 
cnt = 0
for i in range(len(S) // 2):
  if S[i] != S[len(S) - 1 - i]:
    cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
N = int(input())
zeinuki = math.floor(N / 1.08)
print(':('if N != math.floor(zeinuki * 1.08) else zeinuki)

Fixed submission:
import math
N = int(input())
zeinuki = math.floor(N / 1.08)
if N != math.floor(zeinuki * 1.08):
  if N != math.floor((zeinuki + 1) * 1.08):
    print(':(')
  else:
    print(zeinuki + 1)
else:
  print(zeinuki)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
L = list(map(int,input().split()))
L.sort()
count = 0
 
for i in range(N):
  for j in range(i + 1, N):
    for k in range(N - 1, j, -1):
      if L[k] < L[i] + L[j]:
        count += k - j 
        break
print(count)

Fixed submission:
N = int(input())
L = list(map(int,input().split()))
L.sort()
count = 0
from bisect import bisect_left
for i in range(N - 2):
  for j in range(i + 1, N - 1):    
      count += bisect_left(L, L[i] + L[j]) - 1 - j
      
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
L = list(map(int,input().split()))
L.sort()
count = 0
 
for i in range(N):
  for j in range(i + 1, N):
    for k in range(j + 1, N):
      if L[k] < L[i] + L[j]:
        count += 1
print(count)

Fixed submission:
N = int(input())
L = list(map(int,input().split()))
L.sort()
count = 0
from bisect import bisect_left
for i in range(N - 2):
  for j in range(i + 1, N - 1):    
      count += bisect_left(L, L[i] + L[j]) - 1 - j
      
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
L = list(map(int,input().split()))
L.sort()
count = 0

for i in range(N):
  for j in range(i + 1, N):
    for k in range(j + 1, N):
      if L[k] < L[i] + L[j]:
        count += 1
print(count)

Fixed submission:
N = int(input())
L = list(map(int,input().split()))
L.sort()
count = 0
from bisect import bisect_left
for i in range(N - 2):
  for j in range(i + 1, N - 1):    
      count += bisect_left(L, L[i] + L[j]) - 1 - j
      
print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
B = list(map(int,input().split()))
A = []
A.append(B[0])
A.append(B[0])
for i in range(1, N - 2):
  if B[i] < A[i]:
    A[i] = B[i]
  A.append(B[i])

if N > 2:
  A.append(B[-1])
print(sum(A))

Fixed submission:
print(int(input()) ** 3)
Buggy python submission (verdict: Runtime Error):
import math
N = int(input())
print(N*(N-1)/2)


Fixed submission:
S = input()
T = input()

c = 0

for i in range(len(S)):
  if S[i] == T[i]:
    c +=1
print(c)
Buggy python submission (verdict: Runtime Error):
import math
A,B = map(int,input().split())

print(mach.ceil((B-1)/(A-1)))

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

print(math.ceil((B-1)/(A-1)))
Buggy python submission (verdict: Runtime Error):
N = int(input())
H = map(int,input().split())
m = 0
c = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    c+=1
  else:
    m = max(m,c)
    c = 0
print(m)

Fixed submission:
N = int(input())
H = list(map(int,input().split()))
m = 0
c = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    c+=1
  else:
    m = max(m,c)
    c = 0
m = max(m,c)
print(m)

Buggy python submission (verdict: Runtime Error):
N = int(input())
H = map(int,input().split())
m = 0
c = 0
for i in range(H-1):
  if H[i] >= H[i+1]:
    c+=1
  else:
    m = max(m,c)
    c = 0
print(m)

Fixed submission:
N = int(input())
H = list(map(int,input().split()))
m = 0
c = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    c+=1
  else:
    m = max(m,c)
    c = 0
m = max(m,c)
print(m)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
l = []
c=0
for i in range(N):
    s = input()
    ss = sorted(s)
    for te in l:
        if ss == te:
            c+=1
    l.append(ss)
print(c)


Fixed submission:
N = int(input())
l = []
c=0
for i in range(N):
    l.append(sorted(input()))
l.sort()

base =0
next = 1
ren = 1
while True:
    if l[base] == l[next]:
        ren += 1
        next += 1
    else:
        c += ren * (ren - 1) // 2
        base = next
        next += 1
        ren = 1
    if next == N:
        c += ren * (ren-1) // 2
        break
print(c)
Buggy python submission (verdict: Time Limit Exceeded):
L, R = map(int, input().split())
mi = 2019
for i in range(L,R+1):
    for j in range(i+1,R+1):
        mi = min(mi,(i*j)%2019)
    if mi == 0:
        break
print(mi)

Fixed submission:
L, R = map(int, input().split())
target = R+1
if R - L > 10000:
    target = L + 10000
mi = 2019
for i in range(L,target):
    for j in range(i+1,target):
        mi = min(mi,(i*j)%2019)
print(mi)

Buggy python submission (verdict: Time Limit Exceeded):
L, R = map(int, input().split())
mi = 2019
for i in range(L,R+1):
    for j in range(i+1,R+1):
        mi = min(mi,(i*j)%2019)
        if mi == 0:
            break
print(mi)

Fixed submission:
L, R = map(int, input().split())
target = R+1
if R - L > 10000:
    target = L + 10000
mi = 2019
for i in range(L,target):
    for j in range(i+1,target):
        mi = min(mi,(i*j)%2019)
print(mi)
Buggy python submission (verdict: Runtime Error):
W,H,X,Y = map(int,input().split())
if W/2 == X and H/2 == Y:
    f = 1
else:
    f = 0
print(W*H/2, f)


Fixed submission:
X,Y = map(int,input().split())
if X < Y:
    print(0)
else:
    print(10)

Buggy python submission (verdict: Runtime Error):
N,K = map(int,input().split())
a = list(map(int,input().split()))
c = 0
r = [0]*N
r[0] = a[0]
minus = 0
minusidx = 0
start = 0
if r[0] >= K:
    c+=N
    minus += r[0]
    minusidx += 1
    start = 1
for i in range(1,N):
    r[i] = r[i-1] + a[i]
    if r[i]-minus >= K:
        c+= N-i
        for j in range(i):
            minus = r[minusidx]
            minusidx += 1
            if r[i] - minus >= K:
                c += N - i
            else:
                break
print(c)

Fixed submission:
X,Y = map(int,input().split())
if X < Y:
    print(0)
else:
    print(10)
Buggy python submission (verdict: Time Limit Exceeded):
N,M = map(int,input().split())
cards = [True]*N

for g in range(M):
  L,R = map(int,input().split())
  for i in range(L-1):
    cards[i] = False
  for i in range(R,N):
    cards[i] = False
print(cards.count(True))

Fixed submission:
N,M = map(int,input().split())
maL = 0
miR = N
for g in range(M):
  L,R = map(int,input().split())
  maL = max(maL,L)
  miR = min(miR,R)
if maL <= miR:
  print(miR-maL+1)
else:
  print(0)

Buggy python submission (verdict: Time Limit Exceeded):
N,M = map(int,input().split())
gateInfos = [list(map(int,input().split()))for i in range(M)]
c = 0

cards = [True]*N

for g in gateInfos:
  L = g[0]
  R = g[1]
  for i in range(L-1):
    cards[i] = False
  for i in range(R,N):
    cards[i] = False
print(cards.count(True))

Fixed submission:
N,M = map(int,input().split())
maL = 0
miR = N
for g in range(M):
  L,R = map(int,input().split())
  maL = max(maL,L)
  miR = min(miR,R)
if maL <= miR:
  print(miR-maL+1)
else:
  print(0)

Buggy python submission (verdict: Time Limit Exceeded):
N,M = map(int,input().split())
gateInfos = [list(map(int,input().split()))for i in range(M)]
c = 0
for i in range(1,N+1):
  al = True
  for g in gateInfos:
    L = g[0]
    R = g[1]
    if not L <= i <= R:
      al = False
      break
 
  if al:
    c+= 1
print(c)

Fixed submission:
N,M = map(int,input().split())
maL = 0
miR = N
for g in range(M):
  L,R = map(int,input().split())
  maL = max(maL,L)
  miR = min(miR,R)
if maL <= miR:
  print(miR-maL+1)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
if a<b:
	if a<c and c<b:
		print("Yes")
	else:
		print("No")
elif b<a:
	if b<c and c<a:
		 print("Yes")
	else:
		 print("No")
else:
	 print("No")


Fixed submission:
a,b,c=map(int,input().split())
if a<b:
	if a<c and c<b:
		print("Yes")
	else:
		print("No")
elif b<a:
	if b<c and c<a:
		 print("Yes")
	else:
		 print("No")
else:
	 print("No")

Buggy python submission (verdict: Runtime Error):
>>> a,b,c=map(int,input().split())
 
>>> if a<b:
      if a<c and c<b:
          print("Yes")
      else:
          print("No")
    
	elif b<a:
		if b<c and c<a:
			print("Yes")
        else:
        	print("No")
	else:
		print("No")

Fixed submission:
a,b,c=map(int,input().split())
if a<b:
	if a<c and c<b:
		print("Yes")
	else:
		print("No")
elif b<a:
	if b<c and c<a:
		 print("Yes")
	else:
		 print("No")
else:
	 print("No")

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

>>> if a<b:
      if a<c and c<b:
          print("Yes")
      else
          print("No")
    
	elif b<a:
		if b<c and c<a:
			print("Yes")
        else
        	print("No")
	else:
		print("No")

Fixed submission:
a,b,c=map(int,input().split())
if a<b:
	if a<c and c<b:
		print("Yes")
	else:
		print("No")
elif b<a:
	if b<c and c<a:
		 print("Yes")
	else:
		 print("No")
else:
	 print("No")

Buggy python submission (verdict: Runtime Error):
>>> a,b,c=map(int,input().split())
>>> if a<c and c<b:
	print("Yes")
elif b<c and c<a:
	print("Yes")
else:
	print("No")

Fixed submission:
a,b,c=map(int,input().split())
if a<b:
	if a<c and c<b:
		print("Yes")
	else:
		print("No")
elif b<a:
	if b<c and c<a:
		 print("Yes")
	else:
		 print("No")
else:
	 print("No")

Buggy python submission (verdict: Runtime Error):
>>> a,b,c=map(int,input().split())
if a<c and c<b:
	print("Yes")
elif b<c and c<a:
	print("Yes")
else:
	print("No")


Fixed submission:
a,b,c=map(int,input().split())
if a<b:
	if a<c and c<b:
		print("Yes")
	else:
		print("No")
elif b<a:
	if b<c and c<a:
		 print("Yes")
	else:
		 print("No")
else:
	 print("No")

Buggy python submission (verdict: Runtime Error):
>>> a,b,c=map(int,input().split())
if a<c and c<b:
 print("Yes")
elif b<c and c<a:
 print("Yes")
else:
 print("No")

Fixed submission:
a,b,c=map(int,input().split())
if a<b:
	if a<c and c<b:
		print("Yes")
	else:
		print("No")
elif b<a:
	if b<c and c<a:
		 print("Yes")
	else:
		 print("No")
else:
	 print("No")

Buggy python submission (verdict: Runtime Error):
>>> a,b,c=map(int,input().split())
if a<c and c<b:
	print('Yes')
elif b<c and c<a:
  print('Yes')
else
	print('No')


Fixed submission:
a,b,c=map(int,input().split())
if a<b:
	if a<c and c<b:
		print("Yes")
	else:
		print("No")
elif b<a:
	if b<c and c<a:
		 print("Yes")
	else:
		 print("No")
else:
	 print("No")
Buggy python submission (verdict: Runtime Error):
A, B = input().split()
coin = 0
for i in range(2):
    if A > B:
        coin = coin + A
        A = A - 1
    else:
        coin = coin + B
        B = B - 1
print(coin)

Fixed submission:
A, B = input().split()
coin = 0
A = int(A)
B = int(B)
for i in range(2):
    if A > B:
        coin = coin + A
        A = A - 1
    else:
        coin = coin + B
        B = B - 1
print(coin)

Buggy python submission (verdict: Runtime Error):
A = input()
B = input()
x = 0

for num in range(1)
	if A < B;
		x = x + A
		A = A - 1
    else
    	x = x + B
      	B = B - 1
print(x)


Fixed submission:
A, B = input().split()
coin = 0
A = int(A)
B = int(B)
for i in range(2):
    if A > B:
        coin = coin + A
        A = A - 1
    else:
        coin = coin + B
        B = B - 1
print(coin)