Problem:


Score: 300 points

Problem Statement

Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.

A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.

When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.

At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.

In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.
For Kizahashi, write a program that determines whether each of the N players survived this game.

Constraints

All values in input are integers.

2 \leq N \leq 10^5

1 \leq K \leq 10^9

1 \leq Q \leq 10^5

1 \leq A_i \leq N\ (1 \leq i \leq Q)

Input

Input is given from Standard Input in the following format:

N K Q
A_1
A_2
.
.
.
A_Q

Output

Print N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.

Sample Input 1

6 3 4
3
1
3
2

Sample Output 1

No
No
Yes
No
No
No

In the beginning, the players' scores are (3, 3, 3, 3, 3, 3).

Player 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).

Player 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).

Player 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).

Player 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).

Players 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.

Sample Input 2

6 5 4
3
1
3
2

Sample Output 2

Yes
Yes
Yes
Yes
Yes
Yes

Sample Input 3

10 13 15
3
1
4
1
5
9
2
6
5
3
5
8
9
7
9

Sample Output 3

No
No
No
No
Yes
No
No
No
Yes
No



Sample input:
6 3 4
3
1
3
2


Sample output:
No
No
Yes
No
No
No

Submission status: Accepted

Solution code:
n,k,q = list(map(int, input().split()))
a = [int(input()) for _ in range(q)]

from collections import Counter

c = Counter(a)
score = [0] + [k-q] * n

# 正解した分加点する
for player, point in c.items():
    score[player] += point

for p in score[1:]:
    if p <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
A = []
for i in range(Q):
    a = int(input())
    A.append(a)

l = list()
for i in range(N):
    l.append(K-Q)

for a in A:
    l[a-1] += 1

for j in l:
    if j > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N, K, Q = [int(x) for x in input().split()]

scores = [K - Q] * N
for i in range(Q):
    ans = int(input())
    scores[ans - 1] += 1
    

for score in scores:
    print('Yes' if score > 0 else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[14]:


N,K,Q = map(int, input().split())
point = [0]*N
for _ in range(Q):
    A = int(input())
    point[A-1] += 1 
ans = [print("Yes") if point[i] > Q-K else print("No") for i in range(len(point))]


# In[ ]:

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())

correct_dict = {i: 0 for i in range(N)}

for _ in range(Q):
    i = int(input()) - 1
    if i in correct_dict:
        correct_dict[i] += 1
    else:
        correct_dict[i] = 1

for k, v in correct_dict.items():
    if K - Q + v > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
N,K,Q = list(map(int , input().split()))
As = [int(input()) for _ in range(Q)]

#特典初期設定
Score = [0 for _ in range(N)]

for A in As:
    Score[A-1] +=1

for ans in Score:
    if(K + ans - Q > 0):
        print("Yes")
    
    else:
        print("No")

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())

cnt = [0]*n

for i in range(q):
    a = int(input()) -1
    cnt[a] += 1

basis = q-k
for i in cnt:
    if i > basis:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
def resolve():
    N, K, Q = list(map(int, input().split()))
    A = [int(input()) for _ in range(Q)]
    points = [0] * N
    for i in range(Q):
        points[A[i]-1] += 1

    for i in range(N):
        if K + points[i] - Q > 0:
            print('Yes')
        else:
            print('No')

    return

resolve()

Submission status: Accepted

Solution code:
def main():
    N, K, Q = map(int, input().split())
    A = list(int(input()) for _ in range(Q))

    people = [K - Q] * N

    for ans in A:
        people[ans - 1] += 1

    for i in people:
        if i > 0:
            print("Yes")
        else:
            print("No")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
ans = [k-q]*n
for _ in range(q):
    a = int(input())
    ans[a-1] += 1
for i in range(n):
    print(['No','Yes'][ans[i]>0])

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
Score = [0]*(N+1)
for i in range(Q):
    A = int(input())
    Score[A] += 1
for i in range(1, N+1):
    if Score[i] + K - Q > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]
p = [0] * n

for i in a:
    p[i-1] += 1

for i in range(n):
    if k <= q - p[i]:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]

ans = [0] * n

for i in range(q):
  ans[a[i]-1] += 1
for anss in ans:
  print("Yes" if k - q + anss > 0 else "No")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

n, k, q = map(int, input().split())
aq = [int(input()) for _ in range(q)]

point = [0 for _ in range(n+1)]

for i in aq:
    point[i] += 1

for j in range(1, n+1):
    if k - q + point[j] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n,k,q = map(int, input().split())
x = [k] * (n)
for i in range(q):
    a = int(input())
    x[a-1] += 1
for i in range(n):
    if x[i] - q > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
anslist=[k-q]*n
for i in range(q):
    a=int(input())-1
    anslist[a]=anslist[a]+1

for ans in anslist:
    if ans > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
li=[0]*N

for i in range(Q):
    A=int(input())
    li[A-1]+=1

for j in range(N):
    if li[j]+K-Q>0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N ,K , Q = map(int,input().split())
Life = [0]*N
for i in range(Q):
    a = int(input())
    Life[a-1] += 1

for i in range(N):
    if Life[i] <= Q-K:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
n,k,q = map(int, input().split())
a = [int(input()) for _ in range(q)]
ans = [0 for _ in range(n)]
for i in range(q):
    ans[a[i]-1] += 1
for i in range(n):
    if q-ans[i] < k:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n,k,q=list(map(int,input().split()))
a=[]
for i in range(q):
  a.append(int(input()))
from collections import Counter
ac_ans=Counter(a)


for i in range(n):
  if (k-q)+ac_ans.get(i+1,0)>0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
import copy
a,b,c=map(int,input().split())
d=[]
for i in range(c):
    i=int(input())
    d.append(i)
d=[i-1 for i in d]
e=[b]*a

e=[i-len(d) for i in e]
for i in d:
    e[i]+=1
    
for i in e:
    if i>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]
point = [0 for _ in range(n)]
for i in range(q):
	point[a[i]-1] += 1
for i in range(n):
	target = k+point[i]-q
	if target <= 0:
		print("No")
	else:
		print("Yes")

Submission status: Accepted

Solution code:
n, k, q = map(int,input().split())
l = [int(input()) for _ in range(q)]

score = [k-q] * n
for i in l:
    score[i-1] += 1

for j in score:
    if j > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
def main():
    n, k, q = list(map(int, input().split()))
    particapant = [k] * n
    seikai = {}
    for i in range(q):
        s = int(input())
        seikai.setdefault(s, 0)
        seikai[s] += 1
    for i in range(1, n+1):
        point = k
        if i in seikai:
            point -= q - seikai[i]
        else:
            point -= q
        print('Yes') if point > 0 else print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline

N, K, Q = list(map(int, readline().split()))
A = []
for a in range(Q):
    A.append(int(readline()))

points = [0] * N

for i in range(Q):
    points[A[i] - 1] += 1

for p in points:
    score = K - Q + p
    print("Yes" if score > 0 else "No")

Submission status: Accepted

Solution code:
import math
from collections import deque
from collections import defaultdict

import bisect

#自作関数群
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):#階乗
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):#コンビネーション
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def combmod(n,r,mod):
	return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
	r=copyQueue(q)
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): # root
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): # much time
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1
def maxValue(a,b,v):
	v2 = v
	for i in range(v2,-1,-1):
		for j in range(v2//a+1): #j:aの個数
			k = i-a*j
			if k%b==0:
				return i
	return -1
def copyQueue(q):
	nq = queue.Queue()
	n = q.qsize()
	for i in range(n):
		x = q.get()
		q.put(x)
		nq.put(x)
	return nq
def get_sieve_of_eratosthenes(n):
	#data = [2]
	data = [0,0,0]
	for i in range(3,n+1,2):
		data.append(i)
		data.append(0)
	for i in range(len(data)):
		interval = data[i]
		if interval!=0:
			for j in range(i+interval,n-1,interval):
				data[j] = 0
	#ans = [x for x in data if x!=0]
	ans = data[:]
	return ans

n,k,q = readInts()
count = [0 for i in range(n)]
for i in range(q):
	count[readInt()-1]+=1

for i in count:
	if k-(q-i)>0:
		print("Yes")
	else:
		print("No")

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())

S=[]
T=[0]*N
cutline=Q-K+1
count=0
for i in range(Q):
    R=int(input())
    T[R-1]+=1

for i in range(N):
    if T[i]>=cutline:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
A=[int(input()) for i in range(Q)]
point=[0]*N
for a in A:
    point[a-1]+=1
for n in range(N):
    print("Yes" if point[n]>Q-K else "No")

Submission status: Accepted

Solution code:

N,K,Q = map(int,input().split(" "))


ans = [K - Q for i in range(N)]


for i in range(Q):
    A = int(input())
    ans[A-1] = ans[A-1] + 1

for a in ans:
    if a > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.buffer.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.buffer.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.buffer.readline().split()))

n, k, q = rm()
li = [1] * n
if q >= k:
    li = [k-q] * n
    for _ in range(q):
        li[ri()-1] += 1
for i in li:
    if i <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())

lis=[0]*n

for i in range(0,q):
  lis[int(input())-1]+=1
for p in lis:
  if k-q+p>0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
from collections import Counter
N,K,Q = map(int,input().split())
counter = Counter()
for _ in range(Q):
  counter[int(input())] += 1

for i in range(1, N+1):
  p = counter[i]
  if K+p-Q > 0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())

S = [K - Q for i in range(N)]

for i in range(Q):
    A = int(input())
    S[A - 1] += 1

for i in S:
    if i > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import numpy as np

N, K, Q = map(int, input().split()) 
score = np.array([0]*N)

def change_score(N ,A, score):
    #score = score - np.array([1]*N)
    score[A-1] = score[A-1] + 1
    return score

for i in range(Q):
    A = int(input())
    score = change_score(N, A, score)
    #print(score)
    f_score = score

for i in f_score:
    if i + K - Q > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
import sys

input = lambda: sys.stdin.readline().rstrip()


def solve():
    N, K, Q = map(int, input().split())
    points = [K for _ in range(N)]
    correct = [0 for _ in range(N)]

    for _ in range(Q):
        a = int(input()) - 1
        correct[a] += 1

    for i in range(N):
        points[i] -= (Q - correct[i])

    for i in range(N):
        if points[i] <= 0:
            print('No')
        else:
            print('Yes')


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
A=[]
for _ in range(Q):
    A.append(int(input()))
ans=[0]*N
for i in range(Q):
    ans[A[i]-1]+=1
for j in range(N):
    if Q-K<ans[j]:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
l = [int(input()) for i in range(q)]

points = [k - q] * n
for i in range(q):
    points[l[i] - 1] += 1
for i in points:
    if i <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
import sys

N, K, Q = [int(i) for i in input().split()]
t = { k + 1: K for k in range(N) }
for _ in range(Q):
    A = int(input())
    t[A] += 1
for n in range(N):
    if t[n + 1] - Q > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
point = [k] * n
counter = [0] * n
for i in range(q):
    a = int(input())
    a-=1
    counter[a]+=1
for i in range(n):
    diff = q - counter[i]
    point[i] -= diff
for i in range(n):
    if point[i] <= 0: print('No')
    else: print('Yes')

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
li = [k-q for i in range(n)]
a = 0
for i in range(q):
    a = int(input())
    li[a-1]+=1
for i in range(n):
    if li[i] <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
p = [0]*(N+1)
for i in range(Q):
  a = int(input())
  p[a] += 1
#print(p)
for i in range(1,N+1):
  if K-(Q-p[i]) <= 0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
Point = [k - q] * n
for _ in range(q):
    Point[int(input()) - 1] += 1

for e in Point:
    if e > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
N, K, Q =map(int, input().split())

A = {}
for i in range(Q):
    a = int(input())
    if a in A:
        A[a] += 1
    else:
        A[a] = 1

for i in range(N):
    if K - Q > 0:
        print("Yes")
    elif (i + 1) in A:
        if (K - (Q -A[i + 1])) > 0:
            print("Yes")
        else:
            print("No")
    else:
        print("No")

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
A = [int(input()) for i in range(Q)]
correct = [0] * N
for i in range(Q):
    correct[A[i] - 1] += 1

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

Submission status: Accepted

Solution code:
n, k ,q  =map(int, input().split())

lis = [k-q] * n
for _ in range(q):
    tmp = int(input())
    lis[tmp - 1] += 1

for i in lis:
    if i > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())

memo = [-(Q-K)] * N

for _ in range(Q):
    A = int(input())
    memo[A-1] += 1

for num in memo:
    if num > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
# input
n, k, q = map(int, input().split())
a = []
for i in range(q):
  a.append(int(input()))
cnts = [0 for i in range(n)]
  
# main
for i in range(q):
  cnts[a[i]-1] += 1

# output
for d in cnts:
  if k > q - d:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())

point = [0]*N

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

Submission status: Accepted

Solution code:
import collections as col
n,k,q = map(int, input().split())
a = [int(input()) for _ in range(q)]

p = [k-q]*n
for k,v in col.Counter(a).items():
    p[k-1] += v
for i in p:
    print("Yes" if i > 0 else "No")

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
lis=[0]*n
for i in range(q):
    t=int(input())-1
    lis[t]+=1

for j in lis:
    if k-(q-j)>0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
#-*- coding:utf-8 -*-

n, k, q = map(int, input().split())
a_li = [int(input()) for i in range(q)]

b_li = [0]*n

for i in range(q):
    b_li[a_li[i]-1] += 1

for t in range(n):
    pt = k -q + b_li[t]
    if pt > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n,k,q=list(map(int,input().split()))
t=[0]*n

for i in range(q):
  a=int(input())
  t[a-1]+=1

for j in range(n):
  print('Yes' if k-q+t[j]>0 else 'No')

Submission status: Accepted

Solution code:
N, K, Q, *A = map(int, open(0).read().split())

import numpy as np
answered = np.array([0]*N)

for a in A:
    answered[a-1] += 1

for s in answered + K - len(A):
    if s > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())

a = [0]*n
for _ in range(q):
    a[int(input())-1] += 1

for i in range(n):
    point = k - q + a[i]
    if point > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())


if k <= q:
    
    A = []
    for _ in range(q):
        a = int(input())
        A.append(a)

    ans = [0]*n

    from collections import Counter
    cnt = Counter(A)
    for key,v in cnt.items():
        if v >= q-k+1:
            ans[key-1] = 1

    for i in range(n):
        if ans[i] == 0:
            print('No')
        else:
            print('Yes')
        
else:
    for _ in range(n):
        print('Yes')

Submission status: Accepted

Solution code:
import numpy as np
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as comb_with

#A = int(input())
N,K,Q= map(int,input().split())
#A = list(map(int,input().split()))
#B = list(map(int,input().split()))
#S= str(input())
l=np.zeros(N)
l+=(K-Q)
#print(l)
for m in range(Q):
    A = int(input())
    l[A-1]+=1
#    print(l)
l=np.where(l<1,'No','Yes')
for i in l:
    print(i)

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]

import collections
e = collections.Counter(a)
#for i in e:　print(i,e[i])

for i in range(1,1+n):
  if k - q + e[i] > 0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
start = [k-q]*n
answerlist = [int(input()) for _ in range(q)]
for i in tuple(answerlist):
  start[i-1] = start[i-1]+1
for i in range(n):
  if start[i]<=0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
a=[int(input()) for _ in range(q)]
p=[k-q]*n
for i in a:
    p[i-1]+=1
for i in p:
    if i <=0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n, k, q = map(int, input().split())
a = [0]*q
for i in range(q):
    a[i] = int(input())
s = [k-q]*n
for i in range(q):
    s[a[i] - 1] += 1
for j in s:
    if j > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n,k,q = list(map(int,input().split()))
a = [0 for i in range(n)]
 
for i in range(q):
    b = int(input())
    a[b-1] += 1
for i in range(n):
    if k - (q - a[i]) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N,K,Q = map(int, input().split())
#A = [K] * N

A = [0] * N

for i in range(Q):
	a = int(input())
	A[a-1] += 1

sm = sum(A)

for j in range(N):
	if K - (sm-A[j]) > 0:
		print("Yes")
	else:
		print("No")

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    n, k, q = map(int, input().split())
    scores = [0] * n
    for _ in range(q):
        a = int(input())
        scores[a - 1] += 1
    for i in range(n):
        scores[i] = k - q + scores[i]

    for si in scores:
        if si <= 0:
            print('No')
        else:
            print('Yes')


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

def main():
    N, K, Q = map(int, input().split())
    A = [0]*N
    for _ in range(Q):
        a = int(input())
        A[a-1] += 1
    
    for i in range(N):
        ans = K - (Q - A[i])
        if ans > 0:
            print('Yes')
        else:
            print('No')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import collections
n,s,m = map(int, raw_input().split(' '))
cc = collections.Counter()
cumul = 0
for _ in range(m):
	cc[int(raw_input()) - 1] += 1
	cumul += 1
for u in range(n):
	q = s
	q += cc[u] - cumul
	if q > 0:
		print 'Yes'	
	else:
		print 'No'

Submission status: Accepted

Solution code:
from collections import Counter

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

C = Counter(A)

for i in range(1, N+1):
    if K - len(A) + C[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
a = [0] * q

for i in range(q):
    a[i] = int(input())
a_copy = [0] * n

for i in a:
    a_copy[i-1] += 1

for i in a_copy:
    if q - i < k:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
list1=[k]*n
for i in range(q):
    a=int(input())
    list1[a-1]+=1
for i in range(n):
    if list1[i]>q:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
n,k,q = map(int, input().split())
readline = sys.stdin.readline
A = [int(input()) for i in range(q)]

score = [k-q for i in range(n)]
for a in A:
    score[a-1] += 1
for s in score:
    if s > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
A = [int(input()) for i in range(Q)]

correct = [0 for i in range(N)]
for i in range(Q):
    correct[A[i]-1] += 1

for i in range(N):
    if Q - correct[i] < K:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
a = [0 for i in range(n)]
for _ in range(q):
  c = int(input())
  a[c-1] += 1

threshold = q - k
for p in a:
  if p > threshold:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
l=[k]*n
for i in range(q):
    a=int(input())
    l[a-1]+=1
for x in l:
    print('No' if x-q<=0 else 'Yes')
exit()

Submission status: Accepted

Solution code:
N, K, Q = list(map(int, input().split()))
A = []
for _ in range(Q):
    A += [int(input())]
score = [0] + [0] * N
for a in A:
    score[a] += 1

### K - (全部の正解数 - 自分の正解数) > 0
for i in range(1, N + 1):
    if K - (Q - score[i]) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
score = [0]*n
for i in range(q):
    a = int(input())
    a -= 1
    score[a] += 1
for i in range(n):
    if k+score[i] <= q:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
n,k,q = list(map(int,input().split()))
b = [k] * n
for i in range(q):
    a = int(input())
    b[a-1] += 1

for i in range(n):
    ans = b[i] - q
    if(ans <= 0):
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
n,k,q = map(int, input().split())
al = [0]*n
for i in range(q):
    al[int(input())-1]+=1
for i in al:
    print('Yes' if k-q+i>0 else 'No')

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
A = [0 for _ in range(N)]
for i in range(Q):
  A[int(input()) - 1] += 1

ans = []
for a in A:
  if K + a - Q > 0:
    ans.append("Yes")
  else:
    ans.append("No")
print("\n".join(ans))

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
A = [int(input()) for _ in range(Q)]
ls = [K-Q]*N
for i in A:
    ls[i-1] += 1

for k in ls:
    if k > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
ten_array = [K-Q]*N

for i in range(Q):
    ten_array[int(input()) - 1]+=1
for x in ten_array:
    if 0 < x:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
# 間違った人のポイントを引くのではなく、正解した人にポイントを足して最後に全員のポイントから問題数を引く
n, k, q = map(int, input().split())

# 各人の最初のポイント
point = [k] * n

# 問題正解者のリスト
a = []
for i in range(q):
    ai = int(input())
    a.append(ai)

# 正解した人のポイントに+1
for num in a:
    point[num-1] += 1

# 全員のポイントから問題数を引く
point_final = [x-q for x in point]

# YesとNoの判定
for points in point_final:
    if points > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
def main():
    n, k, q = map(int, input().split())
    a = [int(input()) for _ in range(q)]
    point = [k - q] * n
    for i in a:
        point[i -1] += 1
    for i in point:
        if i > 0:
            print('Yes')
        else:
            print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
P=[K-Q]*N
for i in range(Q):
    a=int(input())
    P[a-1]+=1
for i in range(N):
    if P[i]>0:print("Yes")
    else:print("No")

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
A=[int(input())for i in range(Q)]
point=[-Q+K]*N
for i in range(Q):
    point[A[i]-1]+=1
for j in range(N):
    if point[j]>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7


N, K, Q = rl()
A = []
for i in range(Q):
	a = ri()
	A.append(a)

scores = [0] * N
for a in A:
	idx = a-1
	scores[idx] += 1

for s in scores:
	if K > Q-s:
		print('Yes')
	else:
		print('No')

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
ans=[k-q]*n
a=[0]*q
for i in range(q):
  a[i]=int(input())
for i in range(q):
  ans[a[i]-1]=ans[a[i]-1]+1
for i in range(n):
  if ans[i]<=0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
score = [0 for _ in range(N)]

for i in range(Q):
    A = int(input())
    score[A-1] += 1

for s in score:
    if s > Q - K:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


def main():
    N, K, Q = map(int, readline().split())
    As = map(int, readlines())
    Ps = [0] * N
    for A in As:
        Ps[A-1] += 1
    for P in Ps:
        if Q - P < K:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N, K, Q, *A = map(int, open(0).read().split())
ans = [K - Q] * N
for a in A:
    ans[a - 1] += 1
print('\n'.join('Yes' if v > 0 else 'No' for v in ans))

Submission status: Accepted

Solution code:
N, K, Q, *A = map(int, open(0).read().split())
ans = [K - Q] * N
for a in A:
    ans[a - 1] += 1
[print('Yes') if v > 0 else print('No') for v in ans]

Submission status: Accepted

Solution code:
from collections import Counter

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

ju = [0 for _ in range(N)]

for i in range(Q):
    ju[a[i]-1] += 1

# print(ju)
for v in ju:
    if K-Q+v <= 0:
        print("No")
    else:
        print("Yes")