Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
X = input()
mLoop = 10 ** 1000
i = 0
while i < mLoop:
  p = X.find('ST')
  if p == -1:
    break
  q = p + 2
  p -= 1
  while p >= 0 and i < mLoop:
    if not(X[p] == 'S' and X[q] == 'T'):
      break
    p -= 1
    q += 1
    i += 1
  X = ''.join([X[:p + 1],X[q:]])
  i += 1

print(len(X))  

Fixed submission:
X = input()
cnt = 0
res = 0
for i in X:
  if i == 'S':
    cnt += 1
  else:
    if cnt > 0:
      cnt -= 1
    else:
      res += 1
print(cnt + res)

Buggy python submission (verdict: Time Limit Exceeded):
X = input()
for i in range(10 ** 1000):
  p = X.find('ST')
  if p == -1:
    break
  X = ''.join([X[:p],X[p + 2:]])
print(len(X))  

Fixed submission:
X = input()
cnt = 0
res = 0
for i in X:
  if i == 'S':
    cnt += 1
  else:
    if cnt > 0:
      cnt -= 1
    else:
      res += 1
print(cnt + res)

Buggy python submission (verdict: Time Limit Exceeded):
X = input()
for i in range(10 ** 1000):
  p = X.find('ST')
  if p == -1:
    break
  X = ''.join([X[:p],X[p + 2:]])
print(len(X))  

Fixed submission:
X = input()
cnt = 0
res = 0
for i in X:
  if i == 'S':
    cnt += 1
  else:
    if cnt > 0:
      cnt -= 1
    else:
      res += 1
print(cnt + res)

Buggy python submission (verdict: Time Limit Exceeded):
X = input()
for i in range(10 ** 1000):
  p = X.find('ST')
  if p == -1:
    break
  X = X[:p] + X[p + 2:]
print(len(X))  

Fixed submission:
X = input()
cnt = 0
res = 0
for i in X:
  if i == 'S':
    cnt += 1
  else:
    if cnt > 0:
      cnt -= 1
    else:
      res += 1
print(cnt + res)

Buggy python submission (verdict: Time Limit Exceeded):
X = input()
for i in range(10 ** 1000):
  p = X.find('ST')
  if p == -1:
    break
  X = X[:p] + X[p + 2:]
print(len(X))  

Fixed submission:
X = input()
cnt = 0
res = 0
for i in X:
  if i == 'S':
    cnt += 1
  else:
    if cnt > 0:
      cnt -= 1
    else:
      res += 1
print(cnt + res)
Buggy python submission (verdict: Runtime Error):
A,B,C = map(int, input().split())
K = int(input())
D = B
E = C
i1 = 0
i2 = 0
while(D<A):
    D = D*2
    i1 +=1
while(E<A):
    E = E*2
    i2 +=1
if K >= i1+i2:
    print("Yes")
else:
    print("No") 
print(i1)
print(i2)
print(D)
print(E)


Fixed submission:
X = int(input())
if X>=400 and X <=599:
    print("8")
if X>=600 and X <=799:
    print("7")
if X>=800 and X <=999:
    print("6")
if X>=1000 and X <=1199:
    print("5")
if X>=1200 and X <=1399:
    print("4")
if X>=1400 and X <=1599:
    print("3")
if X>=1600 and X <=1799:
    print("2")
if X>=1800 and X <=1999:
    print("1")
Buggy python submission (verdict: Runtime Error):
n,m,q = map(int,input().split())
List = [list(map(int, input().split())) for i in range(q)]

p_max = 0
point =0
A = [1]*n
E = [m]*n

while A != E :

    #得点計算
    for j in range(q):
        if A[List[j][1]-1] - A[List[j][0]-1] == List[j][2]:
            point += List[j][3]


    #最大値の更新
    if p_max < point:
        p_max = point
    point = 0


    #Aの更新
    for i in reversed(range(0,n)):
        if A[i] < m:
            A[i] = A[i] + 1
            if i !=n-1:
                for k in range(i+1,n):
                    A[k] = A[i]
            break

print(p_max)



Fixed submission:
k = int(input())
a,b = map(int,input().split())
if a % k == 0:
    print('OK')
elif a + k - a%k <= b:
    print('OK')
else:
    print('NG')
Buggy python submission (verdict: Runtime Error):
s = int(input())
w = int(input())

if s <= w:
    print('unsafe')
else:
    print('safe')

Fixed submission:
s ,w = map(int, input().split())

if s <= w:
    print('unsafe')
else:
    print('safe')

Buggy python submission (verdict: Runtime Error):
s = int(input())
w = int(input())

if s <= w:
    print('unsafe')
else:
    print('safe')

Fixed submission:
s ,w = map(int, input().split())

if s <= w:
    print('unsafe')
else:
    print('safe')

Buggy python submission (verdict: Runtime Error):
s = input()
w = input()

if s <= w:
    print('unsafe')
else:
    print('safe')

Fixed submission:
s ,w = map(int, input().split())

if s <= w:
    print('unsafe')
else:
    print('safe')
Buggy python submission (verdict: Runtime Error):
import collections
import numpy as np
n = int(input())
List = list(map(int, input().split()))
Col = collections.Counter(List)
CountList = list(Col) 
for i in range(n-len(CountList)):
    CountList.append(0)
#padding = np.zeros_like(list(range(n-len(CountList))))
#print(padding)
#CountList2 = CountList + padding

for i in CountList:
    print(i)

#for i in range(n):
#    CountList[i] = List.count(i+1)


Fixed submission:
import collections

n = int(input())
List = list(map(int, input().split()))
Col = collections.Counter(List)
Col2 = sorted(Col.items())
CountList = [0]*n
for i in Col2:
    CountList[i[0]-1] = i[1]
#CountList = list(Col2.values()) 
#for i in range(n-len(CountList)):
#    CountList.append(0)

for i in CountList:
    print(i)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

List = list(map(int, input().split()))

CountList = list(range(n))
summ = 0
for i in range(n):
    summ += List.count(i+1)
    if summ < n:
        CountList[i] = List.count(i+1)
    else:
        CountList[i] = 0


for j in CountList:
    print(j)

Fixed submission:
import collections

n = int(input())
List = list(map(int, input().split()))
Col = collections.Counter(List)
Col2 = sorted(Col.items())
CountList = [0]*n
for i in Col2:
    CountList[i[0]-1] = i[1]
#CountList = list(Col2.values()) 
#for i in range(n-len(CountList)):
#    CountList.append(0)

for i in CountList:
    print(i)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

List = list(map(int, input().split()))

CountList = list(range(n))

for i in range(n):
    CountList[i] = List.count(i+1)

for j in CountList:
    print(j)

Fixed submission:
import collections

n = int(input())
List = list(map(int, input().split()))
Col = collections.Counter(List)
Col2 = sorted(Col.items())
CountList = [0]*n
for i in Col2:
    CountList[i[0]-1] = i[1]
#CountList = list(Col2.values()) 
#for i in range(n-len(CountList)):
#    CountList.append(0)

for i in CountList:
    print(i)
Buggy python submission (verdict: Runtime Error):
def main():
    N = int(input())
    S = input()

    rcs = [0] * N
    gcs = [0] * N
    bcs = [0] * N

    for i in range(N):
        if S[i] == 'R':
            rcs[i] = 1
        elif S[i] == 'G':
            gcs[i] = 1
        elif S[i] == 'B':
            bcs[i] = 1

    for i in range(1, N):
        rcs[i] += rcs[i - 1]
        gcs[i] += gcs[i - 1]
        bcs[i] += bcs[i - 1]

    result = 0
    for i in range(N):
        if S[i] == 'R':
            for j in range(i + 1, N):
                if S[j] == 'R':
                    continue
                elif S[j] == 'G':
                    result += bcs[N - 1] - bcs[j]
                    t = 2 * j - i
                    if t < N and S[t] == 'B':
                        result -= 1
                elif S[j] == 'B':
                    result += gcs[N - 1] - gcs[j]
                    t = 2 * j - i
                    if t < N and S[t] == 'G':
                        result -= 1
        elif S[i] == 'G':
            for j in range(i + 1, N):
                if S[j] == 'G':
                    continue
                elif S[j] == 'R':
                    result += bcs[N - 1] - bcs[j]
                    t = 2 * j - i
                    if t < N and S[t] == 'B':
                        result -= 1
                elif S[j] == 'B':
                    result += rcs[N - 1] - rcs[j]
                    t = 2 * j - i
                    if t < N and S[t] == 'R':
                        result -= 1
        elif S[i] == 'B':
            for j in range(i + 1, N):
                if S[j] == 'B':
                    continue
                elif S[j] == 'R':
                    result += gcs[N - 1] - gcs[j]
                    t = 2 * j - i
                    if t < N and S[t] == 'G':
                        result -= 1
                elif S[j] == 'G':
                    result += rcs[N - 1] - rcs[j]
                    t = 2 * j - i
                    if t < N and S[t] == 'R':
                        result -= 1
    print(result)


main()

Fixed submission:
n = input()
print("Yes" if "7" in n else "No")
Buggy python submission (verdict: Time Limit Exceeded):
import math
#from functools import reduce
#def gcd(*numbers):
#    return reduce(math.gcd, numbers)
k = int(input())
sum = 0
for i in range(1,k+1):
    for j in range(1,k+1):
        for l in range(1,k+1):
            sum += math.gcd(math.gcd(i,j),l)
print(sum)


Fixed submission:
import math
#from functools import reduce
#def gcd(*numbers):
#    return reduce(math.gcd, numbers)
k = int(input())
sum = 0
for i in range(1,k+1):
    for j in range(1,k+1):
        for l in range(1,k+1):
            sum += math.gcd(math.gcd(i,j),l)
print(sum)

Buggy python submission (verdict: Time Limit Exceeded):
import math
from functools import reduce
def gcd(*numbers):
    return reduce(math.gcd, numbers)
k = int(input())
sum = 0
for i in range(1,k+1):
    for j in range(1,k+1):
        for l in range(1,k+1):
            sum += gcd(i,j,l)
print(sum)


Fixed submission:
import math
#from functools import reduce
#def gcd(*numbers):
#    return reduce(math.gcd, numbers)
k = int(input())
sum = 0
for i in range(1,k+1):
    for j in range(1,k+1):
        for l in range(1,k+1):
            sum += math.gcd(math.gcd(i,j),l)
print(sum)
Buggy python submission (verdict: Runtime Error):
X = input()
a = 2000 / X
if a >= 2000/599:
  print(8)
elif a >= 2000/799:
  print(7)
elif a >= 2000/999:
  print(6)
elif a >= 2000/1199:
  print(5)
elif a >= 2000/1399:
  print(4)
elif a >= 2000/1599:
  print(3)
elif a >= 2000/1799:
  print(2)
elif a >= 2000/1999:
  print(1)

Fixed submission:
X = int(input())

a = 1999/X

if a >= 1999/599:
  print(8)
elif a >= 1999/799:
  print(7)
elif a >= 1999/999:
  print(6)
elif a >= 1999/1199:
  print(5)
elif a >= 1999/1399:
  print(4)
elif a >= 1999/1599:
  print(3)
elif a >= 1999/1799:
  print(2)
elif a >= 1999/1999:
  print(1)
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
print(A * B)

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

Buggy python submission (verdict: Runtime Error):
A = input()
B = input()
C = A * B
print(C)

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

Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(A * B)
print(C)

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

Buggy python submission (verdict: Runtime Error):
import math
A = int(input())
B = int(input())
C = int(A * B)
print(C)

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

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = a * b
print(c)

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

Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(A * B)
print(C)

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

Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = A * B
print(C)

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

Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
print(A * B)

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

Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
print(A * B)

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

Buggy python submission (verdict: Runtime Error):
A = input(int())
B = input(int())
print(A * B)

Fixed submission:
a, b = map(int, input().split())
print(a * b)
Buggy python submission (verdict: Runtime Error):
num = list(map(int, input().split()))
count = 0
for i in num:
  if i = 0:
    count += 1
    print(count)
  else:
    count += 1

Fixed submission:
num = list(map(int, input().split()))
count = 0
for i in num:
  if i == 0:
    count += 1
    print(count)
  else:
    count += 1
Buggy python submission (verdict: Runtime Error):
value = int(input())
if value.count(5) ==2:
  if value.count(7) ==1:
    print('YES')
  else:
    print('NO')
else:
  print('NO')
  


Fixed submission:
value = input()
if value.count("5") ==2:
  if value.count("7") ==1:
    print('YES')
  else:
    print('NO')
else:
  print('NO')

Buggy python submission (verdict: Runtime Error):
value = input()
if value.count(5) ==2:
  if value.count(7) ==1:
    print('YES')
  else:
    print('NO')
else:
  print('NO')
  


Fixed submission:
value = input()
if value.count("5") ==2:
  if value.count("7") ==1:
    print('YES')
  else:
    print('NO')
else:
  print('NO')

Buggy python submission (verdict: Runtime Error):
value = input()
if value.count(5) ==2:
  if value.count(7) ==1:
    print('Yes')
  else:
    print('No')
else:
  print('No')
  

Fixed submission:
value = input()
if value.count("5") ==2:
  if value.count("7") ==1:
    print('YES')
  else:
    print('NO')
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
i = list(map(int, input().split()))
limit = int(input())
k = 0
while not i[0] < i[1] < i[2]:
    if i[2] <= i[1]:
        i[2] *= 2
        k += 1
    if k == limit:
        break
    if i[1] <= i[0]:
        i[1] *= 2
        k += 1
    if k == limit:
        break
if k <= limit and i[0] < i[1] < i[2]:
    print("Yes")
else:
    print("No")

Fixed submission:
i = int(input())
k = 10 - int((i / 200))
print(k)

Buggy python submission (verdict: Runtime Error):
i = list(map(int, input().split()))
limit = int(input())
k = 0
while not i[0] < i[1] < i[2]:
    if i[2] < i[1]:
        i[2] *= 2
        k += 1
    if k == limit:
        break
    if i[1] < i[0]:
        i[1] *= 2
        k += 1
    if k == limit:
        break
if k <= limit and i[0] < i[1] < i[2]:
    print("Yes")
else:
    print("No")

Fixed submission:
i = int(input())
k = 10 - int((i / 200))
print(k)
Buggy python submission (verdict: Time Limit Exceeded):
i = list(map(int, input().split()))
limit = int(input())
k = 0
while not i[0] < i[1] < i[2]:
    if i[2] < i[1]:
        i[2] *= 2
        k += 1
    if k == limit:
        break
    if i[1] < i[0]:
        i[1] *= 2
        k += 1
    if k == limit:
        break
if k <= limit and i[0] < i[1] < i[2]:
    print("Yes")
else:
    print("No")

Fixed submission:
i = list(map(int, input().split()))
limit = int(input())
k = 0
while not i[0] < i[1] < i[2]:
    if i[2] <= i[1]:
        i[2] *= 2
        k += 1
    if k == limit:
        break
    if i[1] <= i[0]:
        i[1] *= 2
        k += 1
    if k == limit:
        break
if k <= limit and i[0] < i[1] < i[2]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
s=input()
t=input()
ct=0
for i in range(0,len(s)):
    if(s[i]!=t[i]):
            s=s.replace("t[i]","i")
            ct=ct+1
print(ct)

Fixed submission:
s=input()
t=input()
ct=0
for i in range(0,len(s)):
    if(s[i]!=t[i]):
            
            ct=ct+1
print(ct)
Buggy python submission (verdict: Runtime Error):
k=int(input())
mal=1      
n=list(map(int,input().split()))
      
          
for i in range(0,len(n)):
            mal=mal*n[i]
            if(mal>=10**18):
                mal=-1
                break
print(mal)

        
           


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

Buggy python submission (verdict: Runtime Error):
k=int(input())
mal=1      
n=list(map(int,input().split()))
      
          
for i in range(0,len(n)):
            mal=mal*n[i]
            if(mal>=10**18):
                print(-1)
                break
print(mal)

    

            


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

Buggy python submission (verdict: Runtime Error):
k=int(input())
mal=1
a=[]      
for i in range(1,k+1):
      n=int(input())
      a.append(n)      
for i in range(0,len(a)):
            mal=mal*a[i]
if(mal<=10**18):
    print(mal)
else:
    print(-1)


Fixed submission:
a,b=map(int,input().split())
print(a*b)
Buggy python submission (verdict: Runtime Error):
k=int(input())
mal=1      
n=list(map(int,input().split()))
      
          
for i in range(0,len(n)):
    mal=mal*n[i]
    if(mal>10**18and n[i]!=0):
            mal=-1
            break
     if(n[i]==0):
        mal=0
        break
print(mal)

        
           


Fixed submission:
k=int(input())
mal=1      
n=list(map(int,input().split()))
      
          
for i in range(0,len(n)):
    mal=mal*n[i]
    if(mal>10**18):
            mal=-1
            break
for j in range(0,len(n)):
    if(n[j]==0):
        mal=0
print(mal)

Buggy python submission (verdict: Runtime Error):
k=int(input())
mal=1      
n=list(map(int,input().split()))
      
          
for i in range(0,len(n)):
    mal=mal*n[i]
    if(mal>10**18and n[i]!=0):
            mal=-1
            break
        if(n[i]==0):
        mal=0
        break
print(mal)

        
           


Fixed submission:
k=int(input())
mal=1      
n=list(map(int,input().split()))
      
          
for i in range(0,len(n)):
    mal=mal*n[i]
    if(mal>10**18):
            mal=-1
            break
for j in range(0,len(n)):
    if(n[j]==0):
        mal=0
print(mal)

Buggy python submission (verdict: Runtime Error):
k=int(input())
mal=1      
n=list(map(int,input().split()))
      
          
for i in range(0,len(n)):
    if(n[i]==0):
        mal=0
        break
    mal=mal*n[i]
        if(mal>10**18):
            mal=-1
            break
print(mal)

        
           


Fixed submission:
k=int(input())
mal=1      
n=list(map(int,input().split()))
      
          
for i in range(0,len(n)):
    mal=mal*n[i]
    if(mal>10**18):
            mal=-1
            break
for j in range(0,len(n)):
    if(n[j]==0):
        mal=0
print(mal)

Buggy python submission (verdict: Time Limit Exceeded):
k=int(input())
mal=1      
n=list(map(int,input().split()))
      
          
for i in range(0,len(n)):
            mal=mal*n[i]
            
if(mal<=10**18):
    print(mal)
else:
    print(-1)


Fixed submission:
k=int(input())
mal=1      
n=list(map(int,input().split()))
      
          
for i in range(0,len(n)):
    mal=mal*n[i]
    if(mal>10**18):
            mal=-1
            break
for j in range(0,len(n)):
    if(n[j]==0):
        mal=0
print(mal)

Buggy python submission (verdict: Runtime Error):
k=int(input()
mal=1
a=[]      
for i in range(1,k+1):
      n=int(input()
      a.append(n)      
for i in range(0,len(a)-1):
            mal=mal*a[i]
if(mal<=10**18):
            print(mal)
else:
     print(-1)       

Fixed submission:
k=int(input())
mal=1      
n=list(map(int,input().split()))
      
          
for i in range(0,len(n)):
    mal=mal*n[i]
    if(mal>10**18):
            mal=-1
            break
for j in range(0,len(n)):
    if(n[j]==0):
        mal=0
print(mal)
Buggy python submission (verdict: Runtime Error):
n=input()
n=int(n)
if(n%10==7):
  print("Yes")
  else:
    print("No")

Fixed submission:
n=input()
n=int(n)
og=n
flag=0
while(n>0):
    d=n%10
    n=n//10
    if(d==7):
        flag=flag+1
        
if(flag>0):
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n=input()
n=int(n)
if(n%10==7)
  print("Yes")
  else
    print("No")

Fixed submission:
n=input()
n=int(n)
og=n
flag=0
while(n>0):
    d=n%10
    n=n//10
    if(d==7):
        flag=flag+1
        
if(flag>0):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if(a+b==15):
      print("+")
elif(a*b=15):
      print("*")
else:
      print("x")
     

Fixed submission:
a,b=map(int,input().split())
if(a+b==15):
      print("+")
elif(a*b==15):
      print("*")
else:
      print("x")

Buggy python submission (verdict: Runtime Error):
a,b=map(int,inout().split())
if(a+b==15):
  print("+")
elif(a*b=15):
  print("*")
else:
  print("x")
 

Fixed submission:
a,b=map(int,input().split())
if(a+b==15):
      print("+")
elif(a*b==15):
      print("*")
else:
      print("x")
Buggy python submission (verdict: Runtime Error):
s=input()
c=0
for i in range(0,len(s)):
  if (s[i]=="+"):
    c=c+1
  else:
   c=c-1
print(C)
  

      

Fixed submission:
s=input()
c=0
for i in range(0,len(s)):
  if (s[i]=="+"):
    c=c+1
  else:
   c=c-1
print(c)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
ct=0
for i in range(1,a+1):
    for j in range(1,32):
        if(a!=b):
            if(i==a):
                break
        else(i==j):
            ct=ct+1
               
print(ct)


Fixed submission:
a,b=map(int,input().split())
ct=0
for i in range(1,a+1):
    for j in range(1,32):
        if(a!=b):
            if(i==b):
                break
            elif(i==j):
                ct=ct+1
        elif(i==j):
            ct=ct+1
               
print(ct)

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

for i in range(1,k+1):
       f=a[2]*2
       a[2]=f
       
c=a[0]+a[1]+a[2]
print(c)
       

    

Fixed submission:
a,b=map(int,input().split())
ct=0
for i in range(1,a+1):
    for j in range(1,32):
        if(a!=b):
            if(i==b):
                break
            elif(i==j):
                ct=ct+1
        elif(i==j):
            ct=ct+1
               
print(ct)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
flag=0
for a in range(1,a+1):
  for b in range(1,b+1);
   if(a==b):
      flag=flag+1
print(flag)      
  
        

Fixed submission:
a,b=map(int,input().split())
ct=0
for i in range(1,a+1):
    for j in range(1,32):
        if(a!=b):
            if(i==b):
                break
            elif(i==j):
                ct=ct+1
        elif(i==j):
            ct=ct+1
               
print(ct)
Buggy python submission (verdict: Runtime Error):
s=input()

ct=0
if(s[0]=="o" or s[1]=="o"or s[2]=="o"):
  f=800
elif(s[0]=="o" and  s[1]=="o"and s[2]=="o"):
  f=1000
elif(elif(s[0]=="o" and  s[1]=="o"):
  f=900
else:
    f=700
print(f)  

Fixed submission:
s=input()
ct=0
for i in range(0,len(s)):
    
    if(s[i]=="o"): 
        ct=ct+1
if(ct>0):
  f=700+100*ct
else:
  f=700
print(f)
Buggy python submission (verdict: Runtime Error):
a,b,x=map(int,input().split())
if(a<=x or a+b==x);
   print("Yes")
else:
  print("No")
         

          

Fixed submission:
a,b,x=map(int,input().split())
if  a>x:
    print("NO")
else:
    if x<=a+b:
        print("YES")
    else:
        print("NO")
Buggy python submission (verdict: Runtime Error):
s=input()
if "a" in s and "b" in s and c in "s":
  print("Yes")
else:
  print("No")
    

      

Fixed submission:
s=input()
if "a" in s and "b" in s and "c" in s:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
a=input()
a=int(a)
b=input()
b=input(b)
c=input()
c=int(c)
d=input()
f=list[a,b,c,d]
print(f[0]+f[1])

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d= int(input())


f=[a,b]
f=sorted(f)
g=[c,d]
g=sorted(g)
    
print(f[0]+g[0])
Buggy python submission (verdict: Runtime Error):
x=input()
x=int(x)
a=input()
a=int(a)
b=input()
b=int(b)
print(x-a)%b)

          

Fixed submission:
x=input()
x=int(x)
a=input()
a=int(a)
b=input()
b=int(b)
print((x-a)%b)
Buggy python submission (verdict: Runtime Error):
a,b=input().split()
c=a+b
a=int.input(a)
if(c==a*a):
  print("Yes")
  else:
    print("No")
          
        
            


Fixed submission:
a,b=input().split()
c=a+b
c=int(c)
flag=0
for i in range(1,c+1):
    if(c==i*i):
      flag=flag+1
      break
if(flag>0):
    print("Yes")
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
a,b=input().split()
c=a+b
a=int.input(a)
if(c==a*a):
  print("Yes")
  else:
    print("no")
          
        
            


Fixed submission:
a,b=input().split()
c=a+b
c=int(c)
flag=0
for i in range(1,c+1):
    if(c==i*i):
      flag=flag+1
      break
if(flag>0):
    print("Yes")
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
n=input()
n=int(n)
og=n
flag=0
for i in range(0,10):
    while(n>0):
    d=n%10
    n=n//10
    if(d==i):
        flag=flag+1

if(flag>=3):
    print("Yes")
else:
    print("No")

Fixed submission:
n=input()
if(n[0]==n[1]==n[2] or n[1]==n[2]==n[3]):
    print("Yes")
else:
    print("No")