Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3


n, c = list(map(int, input().split()))
xv = [[0, 0]]+[list(map(int, input().split())) for i in range(n)] + [[c, 0]]
xv_rev = reversed(xv)

print(xv)
ans = 0
cal = 0
dis = 0

for i in range(1, len(xv)):
    cal += xv[i][1]
    cal -= (xv[i][0]-xv[i-1][0])
    ans = max(cal, ans)

for i in range(1, xv_rev):
    cal += xv[i][1]
    cal -= (xv[i][0]-xv[i-1][0])
    ans = max(cal, ans)

print(ans)


Fixed submission:
#!/usr/bin/env python3

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

x, v = [], []
for i in range(n):
    a, b = list(map(int, input().split()))
    x.append(a)
    v.append(b)

cw = [0]*(n+1)
ccw = [0]*(n+1)
for i in range(n):
    cw[i+1] = cw[i]+v[i]
    ccw[i+1] = ccw[i]+v[-i-1]


for i in range(1, n+1):
    cw[i] -= x[i-1]
    ccw[i] -= c-x[-i]


maxcw = [0]*(n+1)
maxccw = [0]*(n+1)
for i in range(1, n+1):
    maxcw[i] = max(maxcw[i-1], cw[i])
    maxccw[i] = max(maxccw[i-1], ccw[i])

ans = max(0, maxcw[-1], maxccw[-1])

for i in range(1, n+1):
    ans = max(ans, cw[i] + maxccw[-i-1] - x[i-1])
    ans = max(ans, ccw[i] + maxcw[-i-1]-(c-x[-i]))

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3

from scipy.special import comb

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

a.sort()

value = comb(a[1], a[0], exact=True)
ans = [a[1], a[0]]
index = 0
for i in range(2, n):
    value_tmp = comb(a[i], a[index], exact=True)
    x = a[i]
    y = a[index]
    diff = abs((x-2*y)//2)
    while 1:
        y_new = a[index+1]
        diff_new = abs((x-2*y_new)//2)
        if diff_new > diff:
            break
        else:
            index += 1
    if value_tmp > value:
        ans = [a[i], a[index]]
        # value = value_tmp
print(*ans)


Fixed submission:
#!/usr/bin/env python3

import bisect

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

a.sort()

if n == 2:
    print(a[1], a[0])
    exit()
# value = comb(a[1], a[0], exact=True)
# ans = [a[1], a[0]]
# index = 0
# for i in range(2, n):
#     value_tmp = comb(a[i], a[index], exact=True)
#     x = a[i]
#     y = a[index]
#     diff = abs((x-2*y)//2)
#     while 1:
#         y_new = a[index+1]
#         diff_new = abs((x-2*y_new)//2)
#         if diff_new > diff:
#             break
#         else:
#             index += 1
#     if value_tmp > value:
#         ans = [a[i], a[index]]
#         # value = value_tmp
# print(*ans)

x = a[-1]
index = bisect.bisect_left(a[:n-1], x/2)

ans = []
ans.append([abs(x/2-a[index-1]), a[index-1]])
ans.append([abs(x/2-a[index]), a[index]])
ans.append([abs(x/2-a[index+1]), a[index+1]])

ans.sort()

print(x, ans[0][1])

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3

from scipy.special import comb

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


a.sort()

value = comb(a[1], a[0], exact=True)
ans = [a[1], a[0]]
index = 0
for i in range(2, n):
    value_tmp = comb(a[i], a[index], exact=True)
    while 1:
        tmp = comb(a[i], a[index+1], exact=True)
        if value_tmp > tmp:
            break
        else:
            value_tmp = tmp
            index += 1
    if value_tmp > value:
        ans = [a[i], a[index]]
        value = value_tmp
print(*ans)


Fixed submission:
#!/usr/bin/env python3

import bisect

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

a.sort()

if n == 2:
    print(a[1], a[0])
    exit()
# value = comb(a[1], a[0], exact=True)
# ans = [a[1], a[0]]
# index = 0
# for i in range(2, n):
#     value_tmp = comb(a[i], a[index], exact=True)
#     x = a[i]
#     y = a[index]
#     diff = abs((x-2*y)//2)
#     while 1:
#         y_new = a[index+1]
#         diff_new = abs((x-2*y_new)//2)
#         if diff_new > diff:
#             break
#         else:
#             index += 1
#     if value_tmp > value:
#         ans = [a[i], a[index]]
#         # value = value_tmp
# print(*ans)

x = a[-1]
index = bisect.bisect_left(a[:n-1], x/2)

ans = []
ans.append([abs(x/2-a[index-1]), a[index-1]])
ans.append([abs(x/2-a[index]), a[index]])
ans.append([abs(x/2-a[index+1]), a[index+1]])

ans.sort()

print(x, ans[0][1])
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3

a, b = list(map(int, input().split()))
# print(a, b)

a -= 1
b -= 1
wide = 12

ans1 = [["#"]*wide for i in range(wide//2)]

ans2 = [["."]*wide for i in range(wide//2)]

index_x = 0
index_y = 0
while(a > 0):
    ans1[index_y][index_x] = "."
    index_x += 2
    if index_x == wide:
        index_x = 0
        index_y += 2
    a -= 1


index_x = 0
index_y = 1
a = b
while(a > 0):
    ans2[index_y][index_x] = "#"
    index_x += 2
    if index_x == wide:
        index_x = 0
        index_y += 2
    a -= 1

print(100, 100)
for i in ans1+ans2:
    print("".join(i))


Fixed submission:
#!/usr/bin/env python3

a, b = list(map(int, input().split()))
# print(a, b)

a -= 1
b -= 1
wide = 100

ans1 = [["#"]*wide for i in range(wide//2)]

ans2 = [["."]*wide for i in range(wide//2)]

index_x = 0
index_y = 0
while(a > 0):
    ans1[index_y][index_x] = "."
    index_x += 2
    if index_x == wide:
        index_x = 0
        index_y += 2
    a -= 1


index_x = 0
index_y = 1
a = b
while(a > 0):
    ans2[index_y][index_x] = "#"
    index_x += 2
    if index_x == wide:
        index_x = 0
        index_y += 2
    a -= 1

print(100, 100)
for i in ans1+ans2:
    print("".join(i))
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3

import networkx as nx
from networkx.algorithms import bipartite
import numpy as np
import itertools
import matplotlib.pyplot as plt


n = int(input())
ab = [list(map(int, input().split())) for i in range(n)]
cd = [list(map(int, input().split())) for i in range(n)]


match_list = [[] for i in range(n)]
for i in range(n):
    for j in range(n):
        a, b = ab[i]
        c, d = cd[j]

        if a < c and b < d:
            match_list[i].append(j)
# print(match_list)


group1 = range(n)
group2 = range(n, 2*n)

g = nx.Graph()
g.add_nodes_from(group1, bipartite=1)
g.add_nodes_from(group2, bipartite=0)

for i, list_ in enumerate(match_list):
    for j in list_:
        g.add_edge(i, j+n, weight=1)

# A, B = bipartite.sets(g)
# print(A, B)
# pos = dict()
# pos.update((n, (1, i)) for i, n in enumerate(A))
# pos.update((n, (2, i)) for i, n in enumerate(B))
# nx.draw_networkx(g, pos)
# nx.draw_networkx_edges(g, pos)
# plt.axis("off")
# plt.show()


d = nx.max_weight_matching(g)

print(len(d))


Fixed submission:
#!/usr/bin/env python3

import networkx as nx


n = int(input())
ab = [list(map(int, input().split())) for i in range(n)]
cd = [list(map(int, input().split())) for i in range(n)]


match_list = [[] for i in range(n)]
for i in range(n):
    for j in range(n):
        a, b = ab[i]
        c, d = cd[j]

        if a < c and b < d:
            match_list[i].append(j)
# print(match_list)


group1 = range(n)
group2 = range(n, 2*n)

g = nx.Graph()
g.add_nodes_from(group1, bipartite=1)
g.add_nodes_from(group2, bipartite=0)

for i, list_ in enumerate(match_list):
    for j in list_:
        g.add_edge(i, j+n, weight=1)

# A, B = bipartite.sets(g)
# print(A, B)
# pos = dict()
# pos.update((n, (1, i)) for i, n in enumerate(A))
# pos.update((n, (2, i)) for i, n in enumerate(B))
# nx.draw_networkx(g, pos)
# nx.draw_networkx_edges(g, pos)
# plt.axis("off")
# plt.show()


d = nx.max_weight_matching(g)

print(len(d))
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
n, m = list(map(int, input().split()))

graph = [[] for i in range(n)]
for i in range(m):
    l, r, d = list(map(int, input().split()))

    graph[l-1].append([r-1, d])
    graph[r-1].append([l-1, -d])
# print(graph)


def dfs(s):
    for t, d in graph[s]:
        if x[t] is None:
            x[t] = x[s]+d
            if not dfs(t):
                return False
        else:
            if x[t]-x[s] != d:
                return False
    return True


x = [None]*n
ans = True
for i in range(n):
    if x[i] is None:
        x[i] = 0
        if not dfs(i):
            ans = False

print(('No', 'Yes')[ans])


Fixed submission:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(200002)

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

graph = [[] for i in range(n)]
for i in range(m):
    l, r, d = list(map(int, input().split()))

    graph[l-1].append([r-1, d])
    graph[r-1].append([l-1, -d])
# print(graph)


def dfs(s):
    for t, d in graph[s]:
        if x[t] is None:
            x[t] = x[s]+d
            if not dfs(t):
                return False
        else:
            if x[t]-x[s] != d:
                return False
    return True


x = [None]*n
ans = True
for i in range(n):
    if x[i] is None:
        x[i] = 0
        if not dfs(i):
            ans = False

print(('No', 'Yes')[ans])
Buggy python submission (verdict: Runtime Error):
S = tuple((input()))
S = [int(s) for s in S]

flag=0
for i in [0,1]:
    if flag==1:
        break
    for j in [0,1]:
        if flag==1:
            break
        for k in [0,1]:
            value = S[0]
            if i==0:
                value+=S[1]
            else:
                value-=S[1]
            if j==0:
                value+=S[2]
            else:
                value-=S[2]
            if j==0:
                value+=S[3]
            else:
                value-=S[3]
            if value==7:
                flag=1
                x = i
                y = j
                z = k
            if flag==1:
                break
if x==0:
    a = "+"
else:
    a = "-"
if y==0:
    b = "+"
else:
    b = "-"
if z==0:
    c = "+"
else:
    c = "-"

print("{}{}{}{}{}{}{}=7".format(S[0], a, S[1], b, S[2], c, S[3]))

Fixed submission:
import itertools
A, B, C, D =  list(input())

for ops in itertools.product(["+", "-"], repeat=3):
    eq = A+ops[0]+B+ops[1]+C+ops[2]+D
    x = eval(eq)
    if x == 7:
        break
 
print(eq+'=7')
Buggy python submission (verdict: Runtime Error):
start = time.time()
K, S = map(int, input().split())

K+=1

count=0
for i in range(K):
    for j in range(0, K-i):
        tmp = S - (i + j)
        if tmp>=0 and tmp<=K:
            count+=1
#             print(i,j,tmp)

print(count)

end = time.time()
print(end-start)

Fixed submission:
# N^2
K, S = map(int, input().split())

K+=1

count=0
for i in range(K):
    for j in range(0, K):
        tmp = S - (i + j)
        if tmp>=0 and tmp<K:
            count+=1
#             print(i,j,tmp)

print(count)

Buggy python submission (verdict: Time Limit Exceeded):
# N

K, S = map(int, input().split())

K+=1

count=0
for i in range(K):
    for j in range(K):
        for k in range(K):
            if i + j + k == S:
                count+=1
#                 print(i,j,k)
print(count)

Fixed submission:
# N^2
K, S = map(int, input().split())

K+=1

count=0
for i in range(K):
    for j in range(0, K):
        tmp = S - (i + j)
        if tmp>=0 and tmp<K:
            count+=1
#             print(i,j,tmp)

print(count)
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
pn = [2]
n = int(input())
s = 5
if n == 1:
	print(1)
elif n == 2:
	print(5)
else:
	for i in range(3, n+1):
		f = 0
		m = np.sqrt(i)
		j = i
		k = 1
		pnn = 0
		pf = 0
		for l in range(len(pn)):
			t = 0
			if j == 1:
				break
			if pf == 0:
				if pn[l] > m:
					pn.append(i)
					k = 2
					break
			while j % pn[l] == 0:
				pf = 1
				j  = j / pn[l]
				t += 1
			k = k * (t+1)
		s += k * i
	print(s)

Fixed submission:
n = int(input())
ans = 0
for i in range(1, n+1):
	y = n // i
	ans += y * (y +1) * i / 2
print(int(ans))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = input().split()
l = [0] * 30
for i in range(n):
	a[i] = format(int(a[i]), "030b")
	for j in range(30):
		l[j] += int(str(a[i])[j])
for i in range(30):
	l[i] = l[i] % 2
b = ""
for i in range(30):
	b += str(l[i])
b = int(b, 2)
for i in range(n):
	a[i] = b ^ int(a[i], 2)
print(" ".join(map(str, a)))

Fixed submission:
n = int(input())
a = input().split()
l = 0
for i in range(n):
	a[i] = int(a[i])
	l = l ^ a[i]
for i in range(n):
	a[i] = l ^ a[i]
print(" ".join(map(str, a)))
Buggy python submission (verdict: Runtime Error):
from collections import deque
n, m = map(int, input().split())
r = [[0] for i in range(n+1)]
num = {0:0, 1:1}
e = deque([]) 
for i in range(m):
	a, b = map(int, input().split())
	r[a].append(b)
	r[b].append(a)
def c(x):
	for y in r[x]:
		if y not in num:
			num[y] = x
			e.append(y)
	if len(e) > 0:
		c(e.popleft())
	else:
		return
c(1)
print("Yes")
for i in range(2, n+1):
	print(num[i])

Fixed submission:
from collections import deque
n, m = map(int, input().split())
r = [[0] for i in range(n+1)]
num = {0:0, 1:1}
e = deque([]) 
for i in range(m):
	a, b = map(int, input().split())
	r[a].append(b)
	r[b].append(a)
e.append(1)
while len(e) > 0:
	x = e.popleft()
	for y in r[x]:
		if y not in num:
			num[y] = x
			e.append(y)
print("Yes")
for i in range(2, n+1):
	print(num[i])
Buggy python submission (verdict: Runtime Error):
h = [int(x) for x in input().split()]
l = [1] * n
for i in range(m):
	a, b = map(int, input().split())
	if h[a-1] >= h[b-1]:
		l[b-1] = 0
	if h[b-1] >= h[a-1]:
		l[a-1] = 0
print(sum(l))

Fixed submission:
n, m = map(int, input().split())
h = [int(x) for x in input().split()]
l = [1] * n
for i in range(m):
	a, b = map(int, input().split())
	if h[a-1] >= h[b-1]:
		l[b-1] = 0
	if h[b-1] >= h[a-1]:
		l[a-1] = 0
print(sum(l))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
d = input().split(" ")
for i in range(1, n+1):
	print(d.count(str(i)))

Fixed submission:
n = int(input())
d = input().split(" ")
l = [0] * n
for i in range(n-1):
	l[int(d[i])-1] += 1
for i in range(n):
	print(l[i])
Buggy python submission (verdict: Time Limit Exceeded):
s = []
l = input()
for i in range(len(l)):
	s.append(l[i:i+1])
g = 0
q = int(input())
for i in range(q):
	d = input().split(" ")
	if d[0] == "1":
		if g == 0:
			g = 1
		else:
			g = 0
	if d[0] == "2":
		f = d[1]
		if g == 0:
			if f == "1":
				s.insert(0, d[2])
			else:
				s.append(d[2])
		else:
			if f == "1":
				s.append(d[2])
			else:
				s.insert(0, d[2])
if g == 1:
	s.reverse()
	ans = "".join(s)
	print(ans)
else:
	ans = "".join(s)
	print(ans)	

Fixed submission:
from collections import deque
s = deque()
l = input()
for i in range(len(l)):
	s.append(l[i:i+1])
g = 0
q = int(input())
for i in range(q):
	d = input().split(" ")
	if d[0] == "1":
		if g == 0:
			g = 1
		else:
			g = 0
	if d[0] == "2":
		f = d[1]
		if g == 0:
			if f == "1":
				s.appendleft(d[2])
			else:
				s.append(d[2])
		else:
			if f == "1":
				s.append(d[2])
			else:
				s.appendleft(d[2])
if g == 1:
	s.reverse()
	ans = "".join(s)
	print(ans)
else:
	ans = "".join(s)
	print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
s = input()
g = 0
q = int(input())
for i in range(q):
	d = input().split(" ")
	if d[0] == "1":
		if g == 0:
			g = 1
		else:
			g = 0
	if d[0] == "2":
		f = d[1]
		if g == 0:
			if f == "1":
				s = d[2] + s
			else:
				s = s + d[2]
		else:
			if f == "1":
				s = s + d[2]
			else:
				s = d[2] + s
if g == 1:
	ans = s[::-1]
	print(ans)
else:
	print(s)			


Fixed submission:
from collections import deque
s = deque()
l = input()
for i in range(len(l)):
	s.append(l[i:i+1])
g = 0
q = int(input())
for i in range(q):
	d = input().split(" ")
	if d[0] == "1":
		if g == 0:
			g = 1
		else:
			g = 0
	if d[0] == "2":
		f = d[1]
		if g == 0:
			if f == "1":
				s.appendleft(d[2])
			else:
				s.append(d[2])
		else:
			if f == "1":
				s.append(d[2])
			else:
				s.appendleft(d[2])
if g == 1:
	s.reverse()
	ans = "".join(s)
	print(ans)
else:
	ans = "".join(s)
	print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = [] 
for i in range(n):
	list = [" "] * n
	a = int(input())
	for j in range(a):
		data = input().split(" ")
		x = int(data[0])
		y = data[1]
		list[x-1] = y
	l.append(list)
m = 0
for i in range(2**n):
	s = bin(i)
	s = s[2:]
	s = s.zfill(n)
	ll = []
	th = [" "] * n
	for j in range(n):
		if int(s[j]) == 1:
			ll.append(l[j])
			th[j] = "1"
		elif int(s[j]) == 0:
			th[j] = "0" 
	te = 0
	for j in range(n):
		cu = "2"
		for k in range(len(ll)):
			if ll[k][j] == "1" and th[j] != "1":
				te = 1
			elif ll[k][j] == "0" and th[j] != "0":
				te = 1
			if ll[k][j] == "1" and cu == "2":
				cu = "1"
			elif ll[k][j] == "0" and cu == "2":
				cu = "0"
			elif ll[k][j] == "0" and cu == "1":
				te = 1
			elif ll[k][j] == "1" and cu == "0":
				te = 1
	if te == 0:
		f = len(ll)
		if f > m:
			m = f
print(m)

Fixed submission:
n = int(input())
l = [] 
for i in range(n):
	list = [" "] * n
	a = int(input())
	for j in range(a):
		data = input().split(" ")
		x = int(data[0])
		y = data[1]
		list[x-1] = y
	l.append(list)
m = 0
for i in range(2**n):
	s = bin(i)
	s = s[2:]
	s = s.zfill(n)
	ll = []
	th = [" "] * n
	for j in range(n):
		if int(s[j]) == 1:
			ll.append(l[j])
			th[j] = "1"
		elif int(s[j]) == 0:
			th[j] = "0" 
	te = 0
	for j in range(n):
		for k in range(len(ll)):
			if ll[k][j] == "1" or ll[k][j] == "0":
				if ll[k][j] != th[j]:
					te = 1
	if te == 0:
		f = len(ll)
		if f > m:
			m = f
print(m)
Buggy python submission (verdict: Runtime Error):
d,t,s=map(int,input().split())
if d<=t*s:
  print('Yes')
 e;se:
  print('No')

Fixed submission:
d,t,s=map(int,input().split())
if d<=t*s:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
b=0
c=0
for v in range(n-1):
  b+=a[v]
  c+=a[v]*(sum(a)-b)
print(c%(10**9+7))  

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
b=sum(a)
c=0
for v in range(n-1):
  b-=a[v]
  c+=a[v]*b
print(c%(10**9+7))

Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n=int(input())
a=list(map(int,input().split()))
b=0
for v in itertools.combinations(a,2):
  b+=v[0]*v[1]
  if b>=10**9:
    b=b%(10**9+7)
print(b)  


Fixed submission:
n=int(input())
a=list(map(int,input().split()))
b=sum(a)
c=0
for v in range(n-1):
  b-=a[v]
  c+=a[v]*b
print(c%(10**9+7))

Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n=int(input())
a=list(map(int,input().split()))
b=0
for v in itertools.combinations(a,2):
  b+=v[0]*v[1]
  if b>=10**9:
    b=b%(10**9+7)
print(b)  


Fixed submission:
n=int(input())
a=list(map(int,input().split()))
b=sum(a)
c=0
for v in range(n-1):
  b-=a[v]
  c+=a[v]*b
print(c%(10**9+7))

Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n=int(input())
a=list(map(int,input().split()))
b=0
for v in itertools.combinations(a,2):
  b+=v[0]*v[1]
print(b%(10**9+7))  

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
b=sum(a)
c=0
for v in range(n-1):
  b-=a[v]
  c+=a[v]*b
print(c%(10**9+7))
Buggy python submission (verdict: Runtime Error):
x,k,d=map(int,input().split())
a=divmod(abs(x),d)  
if a[0]<k:
  if a[1]==0 and a[0]%2==1:
    print(d)
  elif a[1]==0 and a[0]%2==0:
    print(0)
  elif a[1]!=0 and a[0]%2!=0:
    if x<0:
      print(d-a[1])
    else:
      print(abs(a[1]-d))
  else:
    print(a[1])
else:
  print(abs(x)-d*k)


Fixed submission:
N=input()
if N=="RRR":
  print(3)
elif N=="SRR" or N=="RRS":
  print(2)
elif N=="SSR" or N=="RSR" or N=="SRS" or N=="RSS":
  print(1)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
X=int(input())
if X>=1800:
  print(1)
elif X>=1600:
  print(2)
elif X>=1400:
  print(3) 
elif X>=1200:
  print(4)
elif X>=1000:
  print(5)
elif X>=800:
  print(6)
elif X>=600:
  print(7)
else:
  print(8)

elif X>=1600:
  print(2)  
  

Fixed submission:
X=int(input())
if X>=1800:
  print(1)
elif X>=1600:
  print(2)
elif X>=1400:
  print(3) 
elif X>=1200:
  print(4)
elif X>=1000:
  print(5)
elif X>=800:
  print(6)
elif X>=600:
  print(7)
else:
  print(8)
Buggy python submission (verdict: Runtime Error):
a = list(map(int,input().split()))
b=int(input())
for i in b:
  if list[0]>=list[1]:
    list[1]=list[1]*2
  else:
    if list[1]>=list[2]:
      list[2]=list[2]*2
if list[0]<list[1]<list[2]:
  print("Yes")
else:
  print("No")

Fixed submission:
a = list(map(int,input().split()))
b=int(input())
for i in range(b):
  if a[0]>=a[1]:
    a[1]=a[1]*2
  else:
    if a[1]>=a[2]:
      a[2]=a[2]*2
if a[0]<a[1]<a[2]:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N,K=map(int,input().split())
a=list(map(int,input().split()))
for v in range(K-1):
  if a[v]>=a[K+v]:
    print("No")
  else:
    print("Yes")


Fixed submission:
N,K=map(int,input().split())
a=list(map(int,input().split()))
for v in range(N-K):
  if a[v]>=a[K+v]:
    print("No")
  else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
N,K=map(int,input().split())
a=list[map(int,input().split())]
for v in range(K):
  if a[1+v]<=a[K+1+v]:
    print("No")
  else:
    print("Yes")

Fixed submission:
N,K=map(int,input().split())
a=list(map(int,input().split()))
for v in range(N-K):
  if a[v]>=a[K+v]:
    print("No")
  else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
import numpy
a = list(map(int,input().split()))
b = list(map(int,input().split()))
for v in range(a[0]-a[1]+1):
  c=list(map(numpy.prod(b[0+v:a[0]+v]))
for m in range(a[0]-a[1]):
  if c[m+1]>c[m]:
    print("Yes")
  else:
    print("No")


Fixed submission:
N,K=map(int,input().split())
a=list(map(int,input().split()))
for v in range(N-K):
  if a[v]>=a[K+v]:
    print("No")
  else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
TN=input()
list=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
if TN not in list:
  print("A")
else:
  print("a")


Fixed submission:
a = input()
print('a' if a.islower() else 'A')

Buggy python submission (verdict: Runtime Error):
a=input()
list=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
if a not in list:
  print("A")
else:
  print("a")


Fixed submission:
a = input()
print('a' if a.islower() else 'A')

Buggy python submission (verdict: Runtime Error):
a=input()
list=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
if a in list==False:
  print("A")
else:
  print("a")


Fixed submission:
a = input()
print('a' if a.islower() else 'A')

Buggy python submission (verdict: Runtime Error):
a=input()
list=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
if list(a)==False:
  print("A")
else:
  print("a")


Fixed submission:
a = input()
print('a' if a.islower() else 'A')

Buggy python submission (verdict: Runtime Error):
a=str(input())
list=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
if list(a)=False:
  print("A")
else:
  print("a")


Fixed submission:
a = input()
print('a' if a.islower() else 'A')

Buggy python submission (verdict: Runtime Error):
a=input()
list=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
if list(a)=False:
  print("A")
else:
  print("a")

Fixed submission:
a = input()
print('a' if a.islower() else 'A')
Buggy python submission (verdict: Runtime Error):
a = list(map(int,input().split()))
b = list(map(int,input().split()))
b.sort()
c=0
for i in b[a[1]]:
  c+=b[i]
  return c
print(c)


Fixed submission:
N, K = map(int, input().split())
p = list(map(int, input().split()))
print(sum(sorted(p)[:K]))

Buggy python submission (verdict: Runtime Error):
a = list(map(int,input().split()))
b = list(map(int,input().split()))
b.sort()
for i in b[a[1]]:
  c=0
  c+=b[i]
  return c
print(c)

Fixed submission:
N, K = map(int, input().split())
p = list(map(int, input().split()))
print(sum(sorted(p)[:K]))
Buggy python submission (verdict: Runtime Error):
X,Y=map(int,input().split())
a=Y%4
b=a/2
c=int(Y/4)
if a%2!=0,b+c>X:
  print("No")
else:
  print("Yes")

Fixed submission:
X,Y=map(int,input().split())
a=Y%4
b=a/2
c=int(Y/4)
if a%2!=0 or b+c>X or 4*X<Y or 2*X>Y:
  print("No")
else:
  print("Yes")