Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
# import numpy as np

n, m = map(int, input().split())

t = [0]*n

for i in range(m):
    l, r = map(int, input().split())
    for j in range(n):
        if l<=j+1 and r>=j+1:
            t[j] += 1

print(t.count(m))

Fixed submission:
# -*- coding: utf-8 -*-
# import numpy as np

n, m = map(int, input().split())

l_min = 1
r_max = n+1

for i in range(m):
    l, r = map(int, input().split())
    l_min = max(l_min, l)
    r_max = min(r_max, r)

ans = r_max - l_min + 1
if ans > 0:
    print(ans)
else:
    print(0)

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
import numpy as np

n, m = map(int, input().split())

l = []
r = []
for i in range(m):
    ll, rr = map(int, input().split())
    l.append(ll)
    r.append(rr)

ans = 0

for i in range(1, n+1):
    for j in range(m):
        if l[j] > i or r[j] < i:
            break
        elif j == m-1:
            ans += 1

print(ans)

Fixed submission:
# -*- coding: utf-8 -*-
# import numpy as np

n, m = map(int, input().split())

l_min = 1
r_max = n+1

for i in range(m):
    l, r = map(int, input().split())
    l_min = max(l_min, l)
    r_max = min(r_max, r)

ans = r_max - l_min + 1
if ans > 0:
    print(ans)
else:
    print(0)

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
import numpy as np

n, m = map(int, input().split())

l = []
r = []
for i in range(m):
    ll, rr = map(int, input().split())
    l.append(ll)
    r.append(rr)

ans = 0
t = [[0] * n for i in range(m)]

for i in range(m):
    for j in range(n):
        
        if l[i]<=j+1 and r[i]>=j+1:

            t[i][j] = 1

t_sum = np.sum(t, axis=0)

for i in range(n):
    if t_sum[i] == m:
        ans += 1

print(ans)

Fixed submission:
# -*- coding: utf-8 -*-
# import numpy as np

n, m = map(int, input().split())

l_min = 1
r_max = n+1

for i in range(m):
    l, r = map(int, input().split())
    l_min = max(l_min, l)
    r_max = min(r_max, r)

ans = r_max - l_min + 1
if ans > 0:
    print(ans)
else:
    print(0)
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-

r, g, b, n = map(int, input().split())

l = []
l.append(r)
l.append(g)
l.append(b)

l.sort(reverse = True)

cnt = 0

for i in range((n//l[0])+1):
    sum = i*l[0]

    for j in range(((n-i*l[0])//l[1])+1):
        sum = i*l[0]    #足しすぎていた。
        sum = sum + j*l[1]

        if (n - sum)%l[2] == 0:
            cnt = cnt + 1
print(cnt)

Fixed submission:
# -*- coding: utf-8 -*-

r, g, b, n = map(int, input().split())

ans = 0
for i in range((n//r)+1):
    for j in range(((n-i*r)//g)+1):
        if (n - i*r - j*g)%b == 0:
            ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
a, b, t = map(int, input().split())

# 何回生産出来るか
p = (t+0.5)//a

anc = int(p*b)

print(ans)

Fixed submission:
# -*- coding: utf-8 -*-
a, b, t = map(int, input().split())

t = (t+0.5)//a


bbb = int(t*b)

print(bbb)
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
def gcd(a,b):
    if b==0:return a
    return gcd(b,a%b)

n = int(input())
a_l = list(map(int, input().split()))


g_max = 1
for i in range(n):
    d = a_l.pop(0)

    if n-1==1:
        g = a_l[0]
    else:
        g = gcd(a_l[0], a_l[1])
        if n-1!=2:
            for j in range(2,n-1):
                g=gcd(g,a_l[j])
    # print(g)
    g_max = max(g, g_max)
    # print(d)
    a_l.append(d)

print(g_max)

Fixed submission:
# -*- coding: utf-8 -*-

# 最大公約数
def gcd(a,b):
    if b==0:return a
    return gcd(b,a%b)

# 入力
n = int(input())
a = list(map(int, input().split()))

# 累積GCD
left = [0]*(n+1)
right = [0]*(n+1)
for i in range(n):
    left[i+1] = gcd(left[i], a[i])
for i in reversed(range(n)):
    right[i] = gcd(right[i+1], a[i])

# print(left)
# print(right)

# 集計
ans = 0
for i in range(n):
    l = left[i]
    r = right[i+1]
    ans = max(ans, gcd(l, r))

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
def gcd(a,b):
    if b==0:return a
    return gcd(b,a%b)

n = int(input())
a_l = list(map(int, input().split()))


g_max = 1
for i in range(n):
    d = a_l.pop(0)

    if n-1==1:
        g = a_l[0]
    else:
        g = gcd(a_l[0], a_l[1])
        if n-1==2:g=g
        else:
            for j in range(2,n-1):
                g=gcd(g,a_l[j])
    # print(g)
    g_max = max(g, g_max)
    # print(d)
    a_l.append(d)

print(g_max)

Fixed submission:
# -*- coding: utf-8 -*-

# 最大公約数
def gcd(a,b):
    if b==0:return a
    return gcd(b,a%b)

# 入力
n = int(input())
a = list(map(int, input().split()))

# 累積GCD
left = [0]*(n+1)
right = [0]*(n+1)
for i in range(n):
    left[i+1] = gcd(left[i], a[i])
for i in reversed(range(n)):
    right[i] = gcd(right[i+1], a[i])

# print(left)
# print(right)

# 集計
ans = 0
for i in range(n):
    l = left[i]
    r = right[i+1]
    ans = max(ans, gcd(l, r))

print(ans)

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import math
from functools import reduce

def gcd(numbers):
    return reduce(math.gcd, numbers)

n = int(input())
a_l = list(map(int, input().split()))

g_max = 1
for i in range(n):
    d = a_l.pop(0)
    g = gcd(a_l)
    # print(g)
    g_max = max(g, g_max)
    # print(d)
    a_l.append(d)

print(g_max)

Fixed submission:
# -*- coding: utf-8 -*-

# 最大公約数
def gcd(a,b):
    if b==0:return a
    return gcd(b,a%b)

# 入力
n = int(input())
a = list(map(int, input().split()))

# 累積GCD
left = [0]*(n+1)
right = [0]*(n+1)
for i in range(n):
    left[i+1] = gcd(left[i], a[i])
for i in reversed(range(n)):
    right[i] = gcd(right[i+1], a[i])

# print(left)
# print(right)

# 集計
ans = 0
for i in range(n):
    l = left[i]
    r = right[i+1]
    ans = max(ans, gcd(l, r))

print(ans)
Buggy python submission (verdict: Runtime Error):
>|python|
# -*- coding: utf-8 -*-

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

sum = 0
for i in range(2):
    if A >= B :
        sum = sum + A
        A = A - 1
    else:
        sum = sum + B
        B = B - 1

print(sum)
||<

Fixed submission:
# -*- coding: utf-8 -*-

a,b = map(int,input().split() )

sum = 0
for i in range(2):
    if a>=b :
        sum=sum+a
        a=a-1
    else:
        sum=sum+b
        b=b-1

print(sum)
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-

n, q  = map(int,input().split())

s = input()

for i in range(q):
    l, r  = map(int,input().split())
    a = 0
    for j in range(l-1,r-1):
        if s[j] == 'A' and s[j+1] =='C':
            a = a+1
    print(a)

Fixed submission:
# -*- coding: utf-8 -*-

n, q  = map(int,input().split())
s = input()
l = [0]*q
r = [0]*q
for i in range(q):
    l[i], r[i] = map(int,input().split())


sum = [0]*(n+1)
for i in range(1,n):
    if s[i-1] == 'A' and s[i] =='C':
        sum[i+1] = sum[i] + 1
    else:
        sum[i+1] = sum[i]

#0 1 2 3 4 5 6
# A C A C A C
# 1 2 3 4 5 6

for i in range(q):
    ans = sum[r[i]]-sum[l[i]]
    print(ans)
Buggy python submission (verdict: Runtime Error):
t,x=int(input().split('  '))
print(t/x)

Fixed submission:
# -*- coding: utf-8 -*-

t, x = map(int, input().split())

ans = t/x

print(ans)
Buggy python submission (verdict: Runtime Error):
l = map(int, input().split())

ab = l[0] - l[1]
cab = l[2] - ab

if cab < 0:
  print(0)
else:
  print(cab)

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

ab = a - b
cab = c - ab
 
if cab < 0:
  print(0)
else:
  print(cab)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int.input().split())
l=sorted([a,b,c])
print(l[2]*10 + l[1] + l[0])

Fixed submission:
a,b,c=map(int,input().split())
l=sorted([a,b,c])
print(l[2]*10 + l[1] + l[0])
Buggy python submission (verdict: Runtime Error):
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max(0,max(n.count(l[i])-m.count(l[i])) for i in range(len(l))))

Fixed submission:
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))

Buggy python submission (verdict: Runtime Error):
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max([0,n.count(l[i])-m.count(l[i]) for i in range(len(l))]))

Fixed submission:
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))

Buggy python submission (verdict: Runtime Error):
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max(0,n.count(l[i])-m.count(l[i]) for i in range(len(l))))


Fixed submission:
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))
Buggy python submission (verdict: Runtime Error):
n=input()
if("Yes" if n[0]==n[2] else "No")

Fixed submission:
a,b,c=input()
print("Yes" if a == c else "No")
Buggy python submission (verdict: Runtime Error):
a,b=input().split()
if a=="H":
  print(b)
elif b=="H":
  print("D")
elif:
  print("H")

Fixed submission:
a,b=input().split()
if a=="H":
  print(b)
elif b=="H":
  print("D")
else:
  print("H")
Buggy python submission (verdict: Runtime Error):
def is_lunlun(i):
    list_i = list(str(i))
    for j in range(len(list_i)-1):
        if int(list_i[j]) == 0:
            if int(list_i[j+1]) not in [1,9,0]:
                return False
        elif int(list_i[j]) == 1:
            if int(list_i[j+1]) not in [0,1,2]:
                return False
        elif int(list_i[j]) == 9:
            if int(list_i[j+1]) not in [8,9]:
                return False
        else:
            if abs(int(list_i[j]) - int(list_i[j+1])) > 1:
                return False
    return True



if __name__ == '__main__':
    k = int(input())
    lunlun = (i for i in range(3234566667) if is_lunlun(i))
    for count, i in enumerate(lunlun):
        if count == k:
            print(i)
            break

        

Fixed submission:
if __name__ == '__main__':
    a,b,c = input().split(" ")
    a,b = b,a
    a,c = c,a
    print(a, b, c)

Buggy python submission (verdict: Runtime Error):
if __name__ == '__main__':
    a,b,c = raw_input().split(" ")
    a,b = b,a
    a,c = c,a
    stdout(a, b, c)

Fixed submission:
if __name__ == '__main__':
    a,b,c = input().split(" ")
    a,b = b,a
    a,c = c,a
    print(a, b, c)
Buggy python submission (verdict: Time Limit Exceeded):
if __name__ == '__main__':
    n, k = [int(i) for i in input().split(" ")]
    while abs(n - k) <= n:
        if n%(k*10)==0:
            n = int(n/(k*10))
        else:
            n = abs(n - k)
        
    print(n)

Fixed submission:
if __name__ == '__main__':
    n, k = [int(i) for i in input().split(" ")]
    while abs(n - k) < n and n != 0:
        n = n%k
        if n != 0:
            n = abs(n - k)
    print(n)

Buggy python submission (verdict: Time Limit Exceeded):
if __name__ == '__main__':
    n, k = [int(i) for i in input().split(" ")]
    while abs(n - k) < n:
        n = abs(n - k)
    print(n)
        

Fixed submission:
if __name__ == '__main__':
    n, k = [int(i) for i in input().split(" ")]
    while abs(n - k) < n and n != 0:
        n = n%k
        if n != 0:
            n = abs(n - k)
    print(n)
Buggy python submission (verdict: Runtime Error):
n,m = list(map(int,input().split()))
votes = list(map(int,input().split())

s_vote = sum(vote)
st = 1 // 4 * s_vote
count = 0
for v in votes :
    if v >= st:
        count += 1
print("Yes" if count >= m else "No")

Fixed submission:
n,m = list(map(int,input().split()))
votes = [int(x) for x in input().split()]
votesum = sum(votes)
st = votesum / (4 * m)
count = 0
for v in votes :
    if v >= st:
        count += 1
print("Yes" if count >= m else "No")
Buggy python submission (verdict: Runtime Error):
import bisect
N = int(input())
l = list(map(int,input().split()))
l.sort()
ans =0
for i in range(1,n):
    for j in range(i):
        p = l[i]+ l[j]
        q = bisect.bisect_left(l,p)
        ans += q-i-1

print(ans)

Fixed submission:
import bisect
n = int(input())
l = list(map(int,input().split()))
l.sort()
ans =0
for i in range(1,n):
    for j in range(i):
        p = l[i]+ l[j]
        q = bisect.bisect_left(l,p)
        ans += q-i-1

print(ans)

Buggy python submission (verdict: Runtime Error):
import bisect
N = int(input())
L = list(map(int,input().split()))
L.sort()
ans =0
for i in range(1,n):
    for j in range(i):
        p = l[i]+ l[j]
        q = bisect.bisect_left(l,p)
        ans += q-i-1

print(ans)

Fixed submission:
import bisect
n = int(input())
l = list(map(int,input().split()))
l.sort()
ans =0
for i in range(1,n):
    for j in range(i):
        p = l[i]+ l[j]
        q = bisect.bisect_left(l,p)
        ans += q-i-1

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
import itertools

N = int(input())
l = list(map(int, input().split()))
t = list(itertools.combinations(l, 3))

count = 0
for i in t:
    i_s = sorted(i)
    a,b,c = i_s
    if b <a+c and c<a+b:
        count+=1
print(count)



Fixed submission:
import bisect
n = int(input())
l = list(map(int,input().split()))
l.sort()
ans =0
for i in range(1,n):
    for j in range(i):
        p = l[i]+ l[j]
        q = bisect.bisect_left(l,p)
        ans += q-i-1

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
import itertools

N = int(input())
l = list(map(int, input().split()))
t = list(itertools.combinations(l, 3))

count = 0
for i in t:
    i_s = sorted(i)
    a,b,c = i_s
    if a<b+c and b <a+c and c<a+b:
        count+=1
print(count)



Fixed submission:
import bisect
n = int(input())
l = list(map(int,input().split()))
l.sort()
ans =0
for i in range(1,n):
    for j in range(i):
        p = l[i]+ l[j]
        q = bisect.bisect_left(l,p)
        ans += q-i-1

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
import itertools
N = int(input())
l = list(map(int, input().split()))
t = list(itertools.combinations(l,3))
count =0
for i in t:
    a,b,c = i
    if a<b+c and b<a+c and c<a+b:
        count+=1
print(count)

Fixed submission:
import bisect
n = int(input())
l = list(map(int,input().split()))
l.sort()
ans =0
for i in range(1,n):
    for j in range(i):
        p = l[i]+ l[j]
        q = bisect.bisect_left(l,p)
        ans += q-i-1

print(ans)
Buggy python submission (verdict: Runtime Error):
S = int(input())
n = len(S)
a = "10" * n + "1" * (n % 2)
b = "01" * n + "0" * (n % 2)

print(min(bin(int(s,2) ^ int(a, 2) , bin(int(s, 2) ^ int(b, 2)))))

Fixed submission:
s = input()
n = len(s)
a = "10" * (n // 2) + "1" * (n % 2)
b = "01" * (n // 2) + "0" * (n % 2)

print(min(bin(int(s,2) ^ int(a, 2)).count("1") , bin(int(s, 2) ^ int(b, 2)).count("1")))
Buggy python submission (verdict: Runtime Error):
N , M ,C  = map(int,input().split())
B = map(int, input().split())

count = 0
for i in range(N):
    A = list(map(int, input().split()))
    p = C
    for j in range(M):
        p+= A[j]*B[j]
        if p > 0:
            count+=1
print(count)



Fixed submission:
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
count=0
for i in range(N):
 A=list(map(int,input().split()))
 p=C
 for j in range(M):p+=A[j]*B[j]
 if p>0:count+=1
print(count)

Buggy python submission (verdict: Runtime Error):
N , M ,C  = map(int,input().split())
B = map(int, input().split())

count = 0
for i in range(N):
    A = list(map(int, input().split()))
    p = C
    for j in range(M):
        p+= A[j]*B[j]
        if p > 0:
            count+=1
print(count)



Fixed submission:
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
count=0
for i in range(N):
 A=list(map(int,input().split()))
 p=C
 for j in range(M):p+=A[j]*B[j]
 if p>0:count+=1
print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
p = [int(input()) for _ in range(N)]

print(sum(p) - int(max(p)/2))

Fixed submission:
n = int(input())
if n == 25:
    print("Christmas")
elif n == 24:
    print("Christmas Eve")
elif n == 23:
    print("Christmas Eve Eve")
else:
    print("Christmas Eve Eve Eve")
Buggy python submission (verdict: Runtime Error):
def count_deivisors(n):
    devisors = 0
    for i in range(1, n**0.5+1):
        if n % i == 0:
            devisors += 1
            if i != n // i:
                devisors += 1

    return devisors

n = int(input())

print(sum(count_deivisors(x) == 8 for x in range(1,n+1,2)))



Fixed submission:
def count_divisors(n):
    divisors = 0
    for i in range(1, int(n**0.5) +1):
        if n % i == 0:
            divisors += 1
            if i != n // i:
                divisors += 1

    return divisors

n = int(input())

print(sum(count_divisors(x) == 8 for x in range(1, n+1, 2)))
Buggy python submission (verdict: Runtime Error):
import sys

s = input()
if s[0] == "A" and s.count("C") == 1 and "C" in s[2:-1]:
    ss = set(s)
    ss.remove("A")
    ss.remove("C")
    SS = [i.upper() for i in ss]
    if len(ss & SS) == 0:
        print("AC")
        sys.exit()

print("WA")

Fixed submission:
import sys

s = input()
if s[0] == "A" and s.count("C") == 1 and "C" in s[2:-1]:
    ss = set(s)
    ss.remove("A")
    ss.remove("C")
    SS = set([i.upper() for i in ss])
    if len(ss & SS) == 0:
        print("AC")
        sys.exit()

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

six_list = [6 ** i for i in range(7)]
nine_list = [9 ** i for i in range(6)]

import bisect

def six_nine(n):
    if n == 0:
        return 0
    else:
        six = six_list[bisect.bisect_right(six_list , n) - 1]
        nine = nine_list[bisect.bisect_right(nine_list , n) - 1]
        m = min(six_nine(n - six) , six_nine(n - nine))
        return 1 + m

print(six_nine(n))

Fixed submission:
import bisect
 
x = int(input())
six_list = [6 ** i for i in range(7)]
nine_list = [9 ** i for i in range(6)]
 
 
def six_nine(n):
    if n == 0:
        return 0
    else:
        six = six_list[bisect.bisect_right(six_list, n) - 1]
        nine = nine_list[bisect.bisect_right(nine_list, n) - 1]
        return min(n // six + six_nine(n % six), 1 + six_nine(n - nine))
 
 
print(six_nine(x))
Buggy python submission (verdict: Runtime Error):
 n = int(input())
    s = input()

    m = 0
    for i in range(1, n - 1):
        a = s[:i]
        b = s[i:]
        c = len(set(a) & set(b))
        if c >= m:
            m = c

    print(m)

Fixed submission:
n = int(input())
s = input()

m = 0
for i in range(1, n - 1):
  a = s[:i]
  b = s[i:]
  c = len(set(a) & set(b))
  if c >= m:
    m = c

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

pirnt('Yes' if a+b >= c else 'No')

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

print('Yes' if a+b >= c else 'No')
Buggy python submission (verdict: Runtime Error):
S = list(input())
alpha_list = [chr(i) for i in range(97,97+26)]

S = set(S)
alpha_list = set(alpha_list)
answer = alpha_list - S
answer = sorted(list(answer))[0]
print(answer)

Fixed submission:
S = list(input())
alpha_list = [chr(i) for i in range(97,97+26)]

S = set(S)
alpha_list = set(alpha_list)
answer = alpha_list - S
if alpha_list == S:
    print('None')
else:
    print(sorted(list(answer))[0])
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())

print('GREATER' if A>B else 'LESS' if b>a else 'EQUAL' )

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

print('GREATER' if A>B else 'LESS' if B>A else 'EQUAL' )
Buggy python submission (verdict: Runtime Error):
a, b = input().split()

if a == 'H':
    print(b)
elif a == 'D' and b =='H'
    print('D')
else:
    print('H')

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

print("H" if a ==b else "D" )
Buggy python submission (verdict: Runtime Error):
s = input()
m = []
for i in s:
    if i == "0":
        m.append(i)
    elif i == "1":
        m.append(i)
    else:
        m.pop(-1)
answer = "".join(m)
print(answer)

Fixed submission:
s = input()
m = []
for i in s:
    if i == "0":
        m.append(i)
    elif i == "1":
        m.append(i)
    else:
        try:
            m.pop(-1)
        except:
            continue
answer = "".join(m)
print(answer)

Buggy python submission (verdict: Runtime Error):
s = input()
answer = []
for i in s:
    if i == "0":
        answer.append(0)
    elif i == "1":
        answer.append(1)
    else:
        answer.pop(-1)
print(*answer)


Fixed submission:
s = input()
m = []
for i in s:
    if i == "0":
        m.append(i)
    elif i == "1":
        m.append(i)
    else:
        try:
            m.pop(-1)
        except:
            continue
answer = "".join(m)
print(answer)
Buggy python submission (verdict: Time Limit Exceeded):
L, R = map(int,input().split())
tmp = 2020
for i in range(L, R):
    for j in range(i + 1, R + 1):
        modmin = i * j % 2019 
        if tmp > modmin:
            tmp = modmin
print(tmp)

Fixed submission:
L, R = map(int,input().split())
tmp = 2020
if R // 2019 != L // 2019 or R % 2019 == 0 or L % 2019 == 0:
    print('0')
else:
    for i in range(L, R):
        for j in range(i + 1, R + 1):
            modmin = i * j % 2019 
            if tmp > modmin:
                tmp = modmin
    print(tmp)
Buggy python submission (verdict: Runtime Error):
X,A = input()

if X < A:
    print('0')
else:
    print('10')

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

if X < A:
    print('0')
else:
    print('10')

Buggy python submission (verdict: Runtime Error):
X = input()
A = input()

if X < A:
    print('0')
else:
    print('10')

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

if X < A:
    print('0')
else:
    print('10')

Buggy python submission (verdict: Runtime Error):
X = input()
A = input()

if X < A:
    print('0')
else:
    print('1')

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

if X < A:
    print('0')
else:
    print('10')
Buggy python submission (verdict: Runtime Error):
a,b,c=(int(x) for x in input().split())
 
print(str(c)+" "+str(a)+" " + str(b) " ")

Fixed submission:
a,b,c=input().split()
 
print(str(c)+" "+str(a)+" " + str(b) + " ")

Buggy python submission (verdict: Runtime Error):
a,b,c=input().split()
 
print(str(c)+" "+str(a)+" " + str(b) " ")

Fixed submission:
a,b,c=input().split()
 
print(str(c)+" "+str(a)+" " + str(b) + " ")

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

print(c+" "+a+" " + b " ")

Fixed submission:
a,b,c=input().split()
 
print(str(c)+" "+str(a)+" " + str(b) + " ")

Buggy python submission (verdict: Runtime Error):
x = input()
y = input()
z = input()
  
print(z + " " + x + " " + y)


Fixed submission:
a,b,c=input().split()
 
print(str(c)+" "+str(a)+" " + str(b) + " ")