Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):

def findSumOfDigits(n):
    sum = 0
    while n > 0.1:
        sum = sum + (n % 10)
        #print(n % 10)
        n = n - (n % 10)
        n = n / 10
    return sum

# 整数の入力
n = input()
n = int(n)

a = input()
a = int(a)

b = input()
b = int(b)

ans = 0

for i in range(1,n+1):
    #print(i)
    test = findSumOfDigits(i)
    if a <= test:
        if b >= test:
            ans = ans + i

print(int(ans))


Fixed submission:

def findSumOfDigits(n):
    sum = 0
    while n > 0.1:
        sum = sum + (n % 10)
        #print(n % 10)
        n = n - (n % 10)
        n = n / 10
        #print(n)
    return sum

# スペース区切りの整数の入力
n, a, b = map(int, input().split())

ans = 0

for i in range(1,n+1):
    #print(i)
    test = findSumOfDigits(i)
    if a <= test <= b:
        ans = ans + i

print(ans)

Buggy python submission (verdict: Runtime Error):

def findSumOfDigits(n):
    sum = 0
    while n > 0.1:
        sum = sum + (n % 10)
        #print(n % 10)
        n = n - (n % 10)
        n = n / 10
    return sum

# 整数の入力
n = input()
n = int(n)

a = input()
a = int(a)

b = input()
b = int(b)

ans = 0

for i in range(1,n+1):
    #print(i)
    test = findSumOfDigits(i)
    if a <= test:
        if b >= test:
            ans = ans + i

print(int(ans))


Fixed submission:

def findSumOfDigits(n):
    sum = 0
    while n > 0.1:
        sum = sum + (n % 10)
        #print(n % 10)
        n = n - (n % 10)
        n = n / 10
        #print(n)
    return sum

# スペース区切りの整数の入力
n, a, b = map(int, input().split())

ans = 0

for i in range(1,n+1):
    #print(i)
    test = findSumOfDigits(i)
    if a <= test <= b:
        ans = ans + i

print(ans)
Buggy python submission (verdict: Runtime Error):

# スペース区切りの整数の入力
h, w = map(int, input().split())


#　2次元行列のリストを作る。
list1 = [[0 for i in range(h)] for j in range(w)]
print(list1)

#list1[1][2] = 1
#list1[0][0] = "#"
#list1[1][1] = "."

#print(list1)
#print(list1[-1][-1])
#print(list1[0][0])

#list1[0:] = [int(input()) for i in range(h)]

#print(list1)

s = [0] * w

i = 0
for i in range(0,w):
	s[i] = input()

print(s)

print(list1)
print(list(s[0]))

list1[:][0] = list(s[0])
list1[:][1] = list(s[1])
list1[:][2] = list(s[2])

print(list1)



#list = [[int(i) for i in input().split()] for i in range(h)]

#print(list)


Fixed submission:
#テストファイルで実行する時
import sys
if sys.platform =='ios':
    sys.stdin=open('input_file.txt')

def mine(s,i,j):
	
	ans = 0
	t = s[i-1][j-1]
	if t == '*' or t == '.':
		ans = ans + 0
	else:
		ans = ans + 1

	t = s[i-1][j]
	if t == '*' or t == '.':
		ans = ans + 0
	else:
		ans = ans + 1

	t = s[i-1][j+1]
	if t == '*' or t == '.':
		ans = ans + 0
	else:
		ans = ans + 1

	t = s[i][j-1]
	if t == '*' or t == '.':
		ans = ans + 0
	else:
		ans = ans + 1

	t = s[i][j+1]
	if t == '*' or t == '.':
		ans = ans + 0
	else:
		ans = ans + 1

	t = s[i+1][j-1]
	if t == '*' or t == '.':
		ans = ans + 0
	else:
		ans = ans + 1

	t = s[i+1][j]
	if t == '*' or t == '.':
		ans = ans + 0
	else:
		ans = ans + 1

	t = s[i+1][j+1]
	if t == '*' or t == '.':
		ans = ans + 0
	else:
		ans = ans + 1	

	return ans


h,w = map(int,input().split())
s = [str('*'+input())+'*' for i in range(h)]

test = ''
for i in range(w+2):
	test = test + '*' 

#リストsの頭にtestを追加
s.insert( 0,test)

#リストsの最後にtestを追加
s.insert(len(s),test)

#h行w列の2次元リストの初期化
s2 = [[0] * w for i in range(h)]
						
for i in range(1,h+1):
	for j in range(1,w+1):
		if s[i][j]=='*':
			pass
		elif s[i][j]=='#' :
			s2[i-1][j-1]='#'
		else:
			s2[i-1][j-1] = str(mine(s,i,j))

for i in range(h):
	print(''.join(s2[i]))
Buggy python submission (verdict: Runtime Error):
n = int(input)

k = n//10

a = k%9
b = (n - 10*k)%9

if a == 0 or b == 0:
  ans = 'Yes'
else:
  ans = 'No'

print(ans)

Fixed submission:
n = int(input())

k = str(n)

#print(k[0])
#print(k[1])

if k[0]=='9' or k[1]=='9' :
	ans = 'Yes'
else:
	ans = 'No'
	
print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()

#文字列をリスト化
s = list(s)
s = set(s)
s = sorted(s)

#print(s)

t = 'abcdefghijklmnopqrstuvwxyz'
t = list(t)
#print(t)

if s == t:
	print('None')
else:
	for i in range(len(t)):
		if s[i]!=t[i]:
			print(t[i])
			break




Fixed submission:
s = input()

#文字列をリスト化
s = list(s)
s = set(s)
s = sorted(s)

#print(s)

t = 'abcdefghijklmnopqrstuvwxyz'
t = list(t)
#print(t)

if s == t:
	print('None')
else:
	for i in range(len(t)):
		#print(i)
		if i == 25:
			print(t[i])
			break
		elif s[i]!=t[i]:
			print(t[i])
			break
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = [int(input()) for i in range(n)]

#print(l)

check = [0]*n
go = 0
ans = 0

for i in range(n):
	#print(i)
	check[i] = go
	ans = ans + 1
	go = l[go]-1
	#print(go)
	#print(check)
	
	if go == 1:
		break
	
	if go in check:
		ans = -1
		break

print(ans)


Fixed submission:
n = int(input())
l = [int(input()) for i in range(n)]

#print(l)

go = 0
ans = -1

for i in range(n):
	#print('----')
	#print(i)
	go = l[go]-1
	#print(go)

	if go == 1:
		if ans < 0:
			ans = i +1

#print('-----')
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

ans = 1

for i in range(n):
	
	ans = ans * (i+1)

print(ans%1000000007)



Fixed submission:
n = int(input())

#nの階乗の計算 n!
import math
k = math.factorial(n)

print(k%1000000007)
Buggy python submission (verdict: Time Limit Exceeded):
import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../Documents/input.txt'))
	#print(name)
	sys.stdin = open(name)

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

ans = 1

for i in range(a,b+1):
	#print(i)
	ans = i*ans

if ans > 0:
	print("Positive")
elif ans == 0:
	print("Zero")
else:
	print("Negative")


Fixed submission:
import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../Documents/input.txt'))
	#print(name)
	sys.stdin = open(name)

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

ans = 1

if a > 0 and b > 0:
	print("Positive")
elif a <= 0 and b >=0:
	print("Zero")
else:
	if (a-b)%2 == 0:
		print("Negative")
	else:
		print("Positive")
Buggy python submission (verdict: Runtime Error):
print(abs(-(N%1000)))

Fixed submission:
print(abs((-int(input())%1000)))
Buggy python submission (verdict: Runtime Error):
X, Y, X = map(str, input().split())
print(Z, X, Y)

Fixed submission:
X, Y, Z = map(str, input().split())
print(Z, X, Y)
Buggy python submission (verdict: Runtime Error):
N, K, *H = map(int, input().split())
count = 0
for i in range(H):
  if i >= K:
    count += 1
print(count)


Fixed submission:
N, K, *H = map(int, open(0).read().split())
li = [i for i in H if i >= K]
print(len(li))

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
H = map(int, input().split())
count = 0
for i in range(H):
  if i >= K:
    count += 1
print(count)


Fixed submission:
N, K, *H = map(int, open(0).read().split())
li = [i for i in H if i >= K]
print(len(li))

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
li = []
for i in range(N):
  li.append(int(input())

member = [ n for n in li if e >= K]
print(len(member))


Fixed submission:
N, K, *H = map(int, open(0).read().split())
li = [i for i in H if i >= K]
print(len(li))

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
li = []
for i in range(N):
  li.append(int(input())

member = [ x for j in li if x >= K]
print(len(member))


Fixed submission:
N, K, *H = map(int, open(0).read().split())
li = [i for i in H if i >= K]
print(len(li))

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
li = []
for i in range(N):
  li.append(int(input())

member = [ n for n in li if e >= K]
print(len(member))

Fixed submission:
N, K, *H = map(int, open(0).read().split())
li = [i for i in H if i >= K]
print(len(li))
Buggy python submission (verdict: Runtime Error):
N, K, Q =map(int, input().split())
A = [int(input()) for _ in range(Q)]
point = [K-Q]*N

for i in range(Q):
  point[A[i]-1] += 1
  
for i in range(N):
  print('Yes' if result[i]>0 else 'No')

Fixed submission:
N, K, Q =map(int, input().split())
A = [int(input()) for _ in range(Q)]
point = [K-Q]*N

for i in range(Q):
  point[A[i]-1] += 1
  
for i in range(N):
  print('Yes' if point[i]>0 else 'No')

Buggy python submission (verdict: Time Limit Exceeded):
N, K, Q =map(int, input().split())
A = [int(input()) for _ in range(Q)]
point = [int(K) for _ in range(N)]
result = point[:]

for i in range(Q):
  result = list(map(lambda x: x-1, result))
  result[A[i]-1] += 1

for i in range(N):
  print('Yes' if result[i]>0 else 'No')

Fixed submission:
N, K, Q =map(int, input().split())
A = [int(input()) for _ in range(Q)]
point = [K-Q]*N

for i in range(Q):
  point[A[i]-1] += 1
  
for i in range(N):
  print('Yes' if point[i]>0 else 'No')
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
 
point = 0
for i in range(N):
    a[i] -= 1
    point += b[a[i]]
    if i > 0 and a[i - 1] + 1 == a[i]:
        point += c[a[i - 1]]
 
print(point)

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
 
point = 0
for i in range(N):
    A[i] -= 1
    point += B[A[i]]
    if i > 0 and A[i - 1] + 1 == A[i]:
        point += C[A[i - 1]]
 
print(point)
Buggy python submission (verdict: Runtime Error):
a, s = open(0).read().split()
if a >= 3200:
  print('red')
else:
  print(a)


Fixed submission:
a, s = open(0).read().split()
if int(a) >= 3200:
  print(s)
else:
  print('red')

Buggy python submission (verdict: Runtime Error):
a, s = input().split()
if a >= 3200:
  print('red')
else:
  print(a)

Fixed submission:
a, s = open(0).read().split()
if int(a) >= 3200:
  print(s)
else:
  print('red')
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
if abs(A-K) == abs(B-K):
  print(K)
else:
  print('IMPOSSIBLE')

Fixed submission:
A, B = map(int, input().split())
if (A + B) % 2 == 0:
  k = (A + B) // 2
  print(k)
  exit()
else:
  print('IMPOSSIBLE')
  exit()
Buggy python submission (verdict: Runtime Error):
S = str(input())
for i in range(len(S)):
  if S[i]==S[i+1]:
    print('Good')
    break
  else:
    print('Bad')


Fixed submission:
S = str(input())

if (S[0]==S[1]) or (S[1]==S[2]) or (S[2]==S[3]):
  print('Bad')
else:
  print('Good')

Buggy python submission (verdict: Runtime Error):
S = str(input())
for i in len(S):
  if S[i]==S[i+1]:
    print('Good')
    break
  else:
    print('Bad')

Fixed submission:
S = str(input())

if (S[0]==S[1]) or (S[1]==S[2]) or (S[2]==S[3]):
  print('Bad')
else:
  print('Good')
Buggy python submission (verdict: Runtime Error):
N,X=map(int,input().split())
L=list(map(int,input().split()))
count=1
tmp=0
for i in range(N):
  tmp+=L[i]
  if tmp<=X:
    count+=1
print(count)

Fixed submission:
X, A = map(int,input().split())
if X < A:
  print(0)
else:
  print(10)
Buggy python submission (verdict: Runtime Error):
N, X = map(int, input().split())
L = list(map(int, input().split())
di = 0
for i in range(N):
  if di < X:
    di += L[i]
  else:
    print(i)
    break

Fixed submission:
N,X=map(int,input().split())
L=list(map(int,input().split()))
count=1
tmp=0
for i in range(N):
  tmp+=L[i]
  if tmp<=X:
    count+=1
print(count)
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
S = str(input())
ans = ""
for i in range(0, K-1):
  ans += S[i]
ans += S[K].lower()
for j in range(K+1,N):
  ans += S[j]
print(ans)


Fixed submission:
N, K = map(int, input().split())
S = str(input())
ans = ""
for i in range(N):
  if i == K-1:
    ans += S[i].lower()
  else:
    ans += S[i]
print(ans)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
S = str(input())
ans = ""
for i in range(0, K-1):
  ans.append(S[i])
ans.append(S[K].lower())
for j in range(K+1,N):
  ans.append(S[j])
print(ans)

Fixed submission:
N, K = map(int, input().split())
S = str(input())
ans = ""
for i in range(N):
  if i == K-1:
    ans += S[i].lower()
  else:
    ans += S[i]
print(ans)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
S = str(input())
ans = []
for i in range(0, K-1):
  ans.append(S[i])
ans.append(S[K].lower())
for j in range(K+1,N):
  ans.append(S[j])
print(ans)

Fixed submission:
N, K = map(int, input().split())
S = str(input())
ans = ""
for i in range(N):
  if i == K-1:
    ans += S[i].lower()
  else:
    ans += S[i]
print(ans)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
S = str(input())
S[K] = S[K].lower()
print(S)

Fixed submission:
N, K = map(int, input().split())
S = str(input())
ans = ""
for i in range(N):
  if i == K-1:
    ans += S[i].lower()
  else:
    ans += S[i]
print(ans)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
S = str(input())
S[K] = S[K].lower()

Fixed submission:
N, K = map(int, input().split())
S = str(input())
ans = ""
for i in range(N):
  if i == K-1:
    ans += S[i].lower()
  else:
    ans += S[i]
print(ans)
Buggy python submission (verdict: Runtime Error):
X = list(map(int, input().split()))
X = sort()

print(X[0]*X[1]/2)

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

print(int(X[0]*X[1]/2))
Buggy python submission (verdict: Runtime Error):
----

Fixed submission:
S = str(input())
p = S.count('+') 
m = S.count('-')
print(p-m)

Buggy python submission (verdict: Runtime Error):
S = str(input())
p = S.count('+') 
m = S.sount('-')
print(p-m)

Fixed submission:
S = str(input())
p = S.count('+') 
m = S.count('-')
print(p-m)
Buggy python submission (verdict: Runtime Error):
N, A, B = map(int(input().split()))
if A*N > B:
  print(B)
else:
  print(A*N)

Fixed submission:
N, A, B = map(int, input().split())
print(min(A*N,B))
Buggy python submission (verdict: Runtime Error):
N = map(str, input())
if N[0]==N[2]:
  print('Yes')
else:
  print('No')

Fixed submission:
N = str(input())
if N[0]==N[2]:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
p = 10 ** 18

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

for i in range(n):
    ans *= a[i]

if ans > p:
    print(-1)
else:
    print(ans)

Fixed submission:
p = 10 ** 18

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

if 0 in a:
    print(0)
    quit()

for i in range(n):
    ans *= a[i]
    if ans > p:
        print(-1)
        quit()


print(ans)
Buggy python submission (verdict: Runtime Error):
n, m, x = map(int, input().split())
ca = [list(map(int, input().split())) for _ in range(n)]

ans = []

for i in range(2 ** n):
    jud = [0]*(m-1)
    money = 0
    for j in range(n):
        if (i >> j) & 1:
            money += ca[j][0]
            for k in range(m-1):
                jud[k] += ca[j][k]
    if min(jud) >= x:
        ans.append(money)

if not ans:
    print(-1)
else:
    print(min(ans))

Fixed submission:
n, m, x = map(int, input().split())
ca = [list(map(int, input().split())) for _ in range(n)]

ans = []

for i in range(2 ** n):
    jud = [0]*m
    money = 0
    for j in range(n):
        if (i >> j) & 1:
            money += ca[j][0]
            for k in range(m):
                jud[k] += ca[j][k+1]
    if min(jud) >= x:
        ans.append(money)

if not ans:
    print(-1)
else:
    print(min(ans))
Buggy python submission (verdict: Time Limit Exceeded):
import sys

input = sys.stdin.readline
n, x, y = map(int, input().split())
ans = [0] * (n-1)
for i in range(1, n+1):
    for j in range(1, n+1):
        if i < j:
            # iとjを固定、rangeでi<jを表現
            d = min(j-i, abs(x-i)+abs(j-y)+1, abs(y-i)+abs(x-j)+1)
            # 長さを示すところに+１
            ans[d-1] += 1
print(*ans, sep="\n")

Fixed submission:
n, x, y = map(int, input().split())
ans = [0] * (n-1)
for i in range(1, n):
    for j in range(i+1, n+1):
        # iとjを固定、rangeでi<jを表現
        d = min(j-i, abs(x-i)+abs(j-y)+1, abs(y-i)+abs(x-j)+1)
        # 長さを示すところに+１
        ans[d-1] += 1
print(*ans, sep="\n")

Buggy python submission (verdict: Time Limit Exceeded):
n, x, y = map(int, input().split())
ans = [0] * (n-1)
for i in range(1, n+1):
    for j in range(1, n+1):
        if i < j:
            # iとjを固定、rangeでi<jを表現
            d = min(j-i, abs(x-i)+abs(j-y)+1, abs(y-i)+abs(x-j)+1)
            # 長さを示すところに+１
            ans[d-1] += 1
print(*ans, sep="\n")

Fixed submission:
n, x, y = map(int, input().split())
ans = [0] * (n-1)
for i in range(1, n):
    for j in range(i+1, n+1):
        # iとjを固定、rangeでi<jを表現
        d = min(j-i, abs(x-i)+abs(j-y)+1, abs(y-i)+abs(x-j)+1)
        # 長さを示すところに+１
        ans[d-1] += 1
print(*ans, sep="\n")

Buggy python submission (verdict: Runtime Error):
n, x, y = map(int, input().split())
ans = [0] * (n-1)
for i in range(1, n+1):
    for j in range(1, n+1):
        if i < j
            # iとjを固定、rangeでi<jを表現
            d = min(j-i, abs(x-i)+abs(j-y)+1, abs(y-i)+abs(x-j)+1)
            # 長さを示すところに+１
            ans[d-1] += 1
print(*ans, sep="\n")

Fixed submission:
n, x, y = map(int, input().split())
ans = [0] * (n-1)
for i in range(1, n):
    for j in range(i+1, n+1):
        # iとjを固定、rangeでi<jを表現
        d = min(j-i, abs(x-i)+abs(j-y)+1, abs(y-i)+abs(x-j)+1)
        # 長さを示すところに+１
        ans[d-1] += 1
print(*ans, sep="\n")
Buggy python submission (verdict: Runtime Error):
import math
a, b = map(int, input().split())
print(a * b // math.gcd(a, b))

Fixed submission:
import fractions
a, b = map(int, input().split())
print(a * b // fractions.gcd(a, b))
Buggy python submission (verdict: Runtime Error):
import math

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

if x >= (a ** 2) * b / 2:
    zy = (2 * x) / (a ** 2) - b
    q = b - zy
    print(90 - math.degrees(math.atan(a / q)))

else:
    p = (2 * x) / (a * b)
    print(90 - math.degrees(math.atan(p / b)))

Fixed submission:
import math

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

if x >= (a ** 2) * b / 2:
    zy = (2 * x) / (a ** 2) - b
    if b != zy:
        q = b - zy
        print(90 - math.degrees(math.atan(a / q)))
    else:
        print(0)

else:
    p = (2 * x) / (a * b)
    print(90 - math.degrees(math.atan(p / b)))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
L = list(map(int, input().split()))
cnt = n * (n - 1) * (n - 2) / 6
jud = []

for i in range(n):
    for j in range(n):
        if i > j:
            jud.append(L[i] + L[j])

for p in range(len(jud)):
    for m in range(n):
        if L[m] >= jud[p]:
            cnt -= 1

if cnt < 0:
    print(0)
else:
    print(int(cnt))

Fixed submission:
from _bisect import bisect_left
from _bisect import bisect_right

n = int(input())
L = list(map(int, input().split()))
L = sorted(L)

cnt = 0

for a in range(n):
    for b in range(n):
        if a < b:
            c = bisect_left(L, L[a] + L[b], b)
            cnt += c - b - 1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
L = list(map(int, input().split()))
cnt = n * (n - 1) * (n - 2) / 6
jud = []

for i in range(n):
    for j in range(n):
        if i > j:
            jud.append(L[i] + L[j])

for m in range(n):
    for p in range(len(jud)):
        if L[m] >= jud[p]:
            cnt -= 1

if cnt < 0:
    print(0)
else:
    print(int(cnt))


Fixed submission:
from _bisect import bisect_left
from _bisect import bisect_right

n = int(input())
L = list(map(int, input().split()))
L = sorted(L)

cnt = 0

for a in range(n):
    for b in range(n):
        if a < b:
            c = bisect_left(L, L[a] + L[b], b)
            cnt += c - b - 1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
L = list(map(int, input().split()))
cnt = n * (n - 1) * (n - 2) / 6
jud = []

for i in range(n):
    for j in range(n):
        if i > j:
            jud.append(L[i] + L[j])

for m in range(n):
    for p in range(len(jud)):
        if L[m] >= jud[p]:
            cnt -= 1

if cnt < 0:
    print(0)
else:
    print(int(cnt))

Fixed submission:
from _bisect import bisect_left
from _bisect import bisect_right

n = int(input())
L = list(map(int, input().split()))
L = sorted(L)

cnt = 0

for a in range(n):
    for b in range(n):
        if a < b:
            c = bisect_left(L, L[a] + L[b], b)
            cnt += c - b - 1
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
def maina(n):
    return n-1

N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
score = [int(K) for __ in range(N)]

for i in range(Q):
    score = list(map(maina, score))
    score[A[i]-1] = score[A[i]-1]+1
for k in range(N):
    if score[k] <= 0:
        print("No")
    else:
        print("Yes")

Fixed submission:
n, k, q = map(int, input().split())
p = k-q
l = [p]*n
for i in range(q):
    a = int(input())
    l[a-1] += 1
for k in range(n):
    print("Yes" if l[k]>0 else "No")

Buggy python submission (verdict: Time Limit Exceeded):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
score = [int(K) for __ in range(N)]

for i in range(Q):
    for m in range(N):
        score[m] = score[m]-1
    score[A[i]-1] = score[A[i]-1]+1
for k in range(N):
    if score[k] <= 0:
        print("No")
    else:
        print("Yes")


Fixed submission:
n, k, q = map(int, input().split())
p = k-q
l = [p]*n
for i in range(q):
    a = int(input())
    l[a-1] += 1
for k in range(n):
    print("Yes" if l[k]>0 else "No")

Buggy python submission (verdict: Runtime Error):
import numpy as np
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
score = np.array([int(K) for __ in range(N)])
score_1 = np.array([1 for _mi in range(N)])

for i in range(Q):
    score -= score_1
    score[A[i]-1] = score[A[i]-1]+1
for k in range(N):
    if score[k] <= 0:
        print("No")
    else:
        print("Yes")

Fixed submission:
n, k, q = map(int, input().split())
p = k-q
l = [p]*n
for i in range(q):
    a = int(input())
    l[a-1] += 1
for k in range(n):
    print("Yes" if l[k]>0 else "No")

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
score = np.array([int(K) for __ in range(N)])
score_1 = np.array([1 for _mi in range(N)])

for i in range(Q):
    score -= score_1
    score[A[i]-1] = score[A[i]-1]+1
for k in range(N):
    if score[k] <= 0:
        print("No")
    else:
        print("Yes")

Fixed submission:
n, k, q = map(int, input().split())
p = k-q
l = [p]*n
for i in range(q):
    a = int(input())
    l[a-1] += 1
for k in range(n):
    print("Yes" if l[k]>0 else "No")

Buggy python submission (verdict: Time Limit Exceeded):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
score = [int(K) for __ in range(N)]

for i in range(Q):
    for m in range(N):
        score[m] = score[m]-1
    score[A[i]-1] = score[A[i]-1]+1
for k in range(N):
    if score[k] <= 0:
        print("No")
    else:
        print("Yes")

Fixed submission:
n, k, q = map(int, input().split())
p = k-q
l = [p]*n
for i in range(q):
    a = int(input())
    l[a-1] += 1
for k in range(n):
    print("Yes" if l[k]>0 else "No")