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:
import sys
from collections import Counter
input=sys.stdin.readline

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

ans=[False]*n
for key,v in a.items():
    if k-(q-v)>0:
        ans[key-1]=True

ss=set(a.keys())

for i in range(n):
    if i+1 in ss:continue
    if k-q>0:
        ans[i]=True
    


for e in ans:
    if e:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
count=[0]*A
for i in range(C):
    Ans=int(input())
    count[Ans-1]+=1
for i in range(A):
    if C-count[i]>=B:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

arr = [0]*num


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

arr = [i-(q-k) for i in arr]

for i in range(len(arr)):
    if arr[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k, q = map(int,input().split())
ans_li = [int(input()) for i in range(q)]
point_li = [k] * n
for i in ans_li:
    point_li[(i - 1)] += 1
for j in point_li:
    if j - len(ans_li) > 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)]

points = [0] * N

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

n_points = [0 for _ in range(n)]

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

for n_point in n_points:
    if n_point + k > q:
        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 = [K for _ in range(N)]
for i in range(Q):
  point[A[i]-1] += 1
point = [i-Q for i in point]
for i in range(N):
  if point[i]>0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

from collections import Counter
poi = Counter(A).most_common()

ans = [k-q]*(n+1)

for (i, cnt) in poi:
    ans[i] += cnt

for x in ans[1:]:
    if x > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

mypoint = [0 for i in range(N)]

#print(mypoint)


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

#print(mypoint)

#mymax = max(mypoint)


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

Submission status: Accepted

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

dic={}
for i in range(n):
  dic[i]=0

for i in range(q):
  dic[a[i]-1]=dic[a[i]-1]+1

for i in range(n):
  if(k-(q-dic[i])>0):
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

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

for i in A:
    if i>=1:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
from collections import defaultdict

def main():
  n, k, q = map(int, input().split())
  member = defaultdict(lambda : 0)
  for _ in range(q):
    member[int(input())] += 1
  
  thresh = q - k
  
  for i in range(1, n+1):
    print("Yes" if member[i] > thresh else "No")
  
  
  
if __name__ == "__main__":
  main()

Submission status: Accepted

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



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

array = []
sum_d = sum(d)
for i in range(N):
    array.append(K-sum_d+d[i])

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

Submission status: Accepted

Solution code:
inps = list(map(int,input().split(" ")))
N = inps[0]
K = inps[1]
Q = inps[2]

Ap = [0] * N
for i in range(Q):
    a = int(input())

    Ap[a-1] += 1

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

Submission status: Accepted

Solution code:
import numpy as np
N,K,Q = map(int, input().split())

points = np.array([K-Q] * N)
getpoints = np.array([0] * N)

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

points += getpoints

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

Submission status: Accepted

Solution code:
a=input().split(" ")
N=int(a[0])
K=int(a[1])
Q=int(a[2])
list1=[]
list2=[]
for i in range(Q):
    list1.append(int(input()))
for i in range(N):
    list2.append(-Q+K)
for i in range(Q):
    list2[list1[i]-1]+=1
for i in range(N):
    if list2[i]>0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N, K, Q = map(int,input().split())
scores = [K for _ in range(N)]
for _ in range(Q):
    answerer = int(input()) - 1
    scores[answerer] += 1
for final_score in scores:
    if final_score - Q <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
if __name__ == "__main__":
  n, k, q = list(map(int, input().split()))
  A = [k-q]*n
  for _ in range(q):
    a = int(input())
    A[a-1] += 1

  for i in range(n):
    print("Yes\n" if A[i]>0 else "No\n")

Submission status: Accepted

Solution code:
from collections import Counter

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

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

Submission status: Accepted

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

Submission status: Accepted

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


for i in m:
    ans = k-q+i
    if ans > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
a = list(int(input()) for i in range(q))
# print(n, k, q)
# print(a)

p = []
for i in range(n):
    p.append(0)
# print(p)

for i in a:
    p[i - 1] += 1
# print(p)

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

Submission status: Accepted

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

for m in mp:
  if k - q + m > 0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
class Solution(object):
    def __init__(self):
        pass
        
    def Sol(self, n, k, r):
        fq = dict([(i, 0) for i in range(0, n + 1)]) 
        t = 0
        for _r in r:
            fq[_r] += 1
            t += 1
        
        player = [k for i in range(0, n)]
        for i in range(0, n):
            player[i] = k - t + fq[i + 1]
        return player


def main():
    info = [int(e) for e in input().split()]
    r = []
    for _ in range(0, info[2]):
        r.append(int(input()))
    pl = Solution().Sol(info[0], info[1], r)
    for sc in pl:
        if sc <= 0:
            print('No')
        else:
            print('Yes')
    return 0

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
points = [K] * N
for q in range(Q):
    i = int(input()) - 1
    points[i] += 1
for point in points:
    if (point - Q > 0):
        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()))

sc = [0] * N

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k, q = [int(v) for v in input().split()]
a_s = [int(input()) for _ in range(q)]
points = [0] * n

for a1 in a_s:
  a = a1 - 1
  points[a] += 1

for i in range(n):
  if k - (q - points[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)]

P = [K] * N
for i in range(N):
    P[i] -= Q

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

for p in P:
    if p > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

score = [0] * N

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

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

Submission status: Accepted

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

Submission status: Accepted

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

score = [0] * n

for _ in range(q):
    a = int(input())
    score[a-1] +=1
    
s = sum(score)
for i in range(n):
    if k - (s-score[i]) <= 0:
        print("No")
    else :
        print("Yes")

Submission status: Accepted

Solution code:
nkq = input().split(' ');
n = int(nkq[0]);
k = int(nkq[1]);
q = int(nkq[2]);
point = [0]*(n+1);
for i in range(q) :
	a = int(input());
	point[a] += 1;

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

Submission status: Accepted

Solution code:
import collections

N, K, Q = map(int, input().split())
A = [0] * N
for i in range(Q):
    A[int(input()) - 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())
nl = [k - q]*n
a = []
for i in range(q):
    a.append(int(input()))
for j in a:
    nl[j-1] += 1
for k in range(n):
    if nl[k] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
tmp = [K] * N
for _ in range(Q):
    a = int(input())
    tmp[a-1] += 1
for i in range(N):
    tmp[i] -= Q
    if tmp[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)]
b = [k] * n
for i in a:
    b[i - 1] += 1
for i in b:
    i -= q
    if i <= 0:
        print('No')
    else: print('Yes')

Submission status: Accepted

Solution code:
import numpy as np
N, K, Q = map(int, input().split())
A = np.zeros(N, dtype=np.int32)
for idx in range(Q):
    A[int(input())-1] += 1

A = A + K - Q
for i in A:
    if i <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

#point = [k for i in range(n)]
tmp = [0 for i in range(n)]
for i in range(q):
    answer = int(input())
    tmp[answer-1] += 1

for i in range(n):
    if k - (q - tmp[i]) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

A = [K-Q] * (N+1)

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

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

Submission status: Accepted

Solution code:
import sys
from pprint import pprint

def solve(n, k, q, a):
    ans = 0

    col = [0] * n
    for a_i in a:
        col[a_i - 1] += 1

    for col_i in col:
        if k - q + col_i > 0:
            print("Yes")
        else:
            print("No")

if __name__ == '__main__':
    n, k, q = map(int, sys.stdin.readline().strip().split(" "))
    a = []
    for _ in range(q):
        a.append(int(sys.stdin.readline().strip()))
    solve(n, k, q, a)

Submission status: Accepted

Solution code:
import sys


def main():
    n, k, q = [int(s) for s in sys.stdin.readline().strip().split()]
    a = [0] * q
    for i in range(q):
        a[i] = int(sys.stdin.readline().strip()) - 1

    scores = [0] * n
    for ai in a:
        scores[ai] += 1

    for i in range(n):
        score = scores[i]
        lose = q - score
        if lose >= k:
            print('No')
        else:
            print('Yes')


main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

for ans in answers:
  print('Yes' if ans>border else 'No')

Submission status: Accepted

Solution code:

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

A = [0]*Q
B = [K-Q]*N

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


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

Submission status: Accepted

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

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

for i in range(n):
  print("Yes" if k - (q - p[i]) > 0 else "No")

Submission status: Accepted

Solution code:
import numpy as np
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]

players = list(np.array([K - len(A)] * N))
for a in A:
    players[a-1] += 1
    
for p in players:
    if p > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
seikaiList = [int(input()) for _ in range(Q)]
seikaiList2 = [0]*N
pointList = [K]*N
for seikai in seikaiList:
    seikaiList2[seikai-1] += 1

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

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
# print(N, K, Q)
# N人、Kポイント、Q問
A = []

for i in range(Q):
	a = int(input())
	A.append(a)
# print(A)

result = [K - Q] * N

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

for r in result:
	if r > 0:
		print('Yes')
	else:
		print('No')

Submission status: Accepted

Solution code:
import collections

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

seikai = collections.Counter([int(input()) for _ in range(Q)])

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

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
A =[0]*N
P = [K]*N
for i in range(Q):
    p = int(input())
    A[p-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())

answered = [K - Q] * N

for q in range(Q):
    correct = int(input())
    answered[correct - 1] += 1
for item in answered:
    if item <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
def main():
    n, k, q = [int(x) for x in input().split()]

    ok = [0] * n

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

main()

Submission status: Accepted

Solution code:

n, k, q = list(map(int, input().split()))
p = [0]*n
for _ in range(q):
    a = int(input())
    p[a-1] += 1

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

Submission status: Accepted

Solution code:
"""
N = int(input())
A, B = map(int,input().split())
A = list(map(int,input().split())) ## 横一列
A = [int(input()) for _ in range(N)] ## 縦一列
lst = [list(map(int,input().split())) for i in range(M)] ## 二次元
"""

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

cnt = [0]*N
for i in range(Q):
  cnt[A[i]-1] += 1
#print(cnt)

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

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

Submission status: Accepted

Solution code:
import array


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

A = array.array('i', [0]*N)

for _ in range(Q):
    i = int(input())
    A[i-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 = [int(i) for i in input().split()]
a = [int(input()) for _ in range(q)]

point = [k-q]*n

ans_point = [0]*n
for cur_a in a:
    ans_point[cur_a - 1] += 1

point = [point[i] + ans_point[i] for i in range(n)]

for cur_point in point:
    if cur_point > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

from collections import Counter

A = [int(input()) for _ in range(Q)]

c = Counter(A)

for n in range(1, N + 1):
    if K - Q + c[n] <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

M = [k-q]*n

for i in range(q):
  a = int(input())
  M[a-1] += 1
for i in range(n):
  if M[i] <= 0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(100000)

def ins(): return input().split()
def ii(): return int(input())
def iil(): return list(map(int,ins()))
def lin(): return list(input())
def iin(): return map(int,ins())

n, k, q = iin()
t = k - q
ans = [t]*n
for _ in range(q):
    ans[ii()-1] += 1
for j in ans:
    print('Yes' if j>0 else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
from collections import Counter
N,K,Q=map(int, raw_input().split())
A=[ int(sys.stdin.readline().strip()) for _ in range(Q) ]


C=Counter(A)


L=[ K-Q for _ in range(N) ]

for i,v in C.items():
	L[i-1]+=v

for x in L:
	if 0<x:
		print "Yes"
	else:
		print "No"

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
A_s = {i+1:0 for i in range(N)}
for _ in range(Q):
    A_s[int(input())] += 1
for k,v in A_s.items():
    if K-(Q-v) <= 0:
        print('No')
    else:
        print('Yes')

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 tokuten in point:
  lef = Q - tokuten
  if lef < K: print("Yes")
  else: print("No")

Submission status: Accepted

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

for _ in range(Q):
    a = int(input())
    P[a - 1] += 1
    
for p in P:
    if Q - p >= K:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

line = q - k + 1
point = [0 for i in range(n)]
for i in range(q):
    ai = int(input()) - 1
    point[ai] += 1

for i in range(n):
    if point[i] >= line:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
from collections import Counter

N, K, Q = map(int, input().split())
A = list(int(input()) for i in range(Q))
c = Counter(A)
for i in range(N):
    if Q - c[i + 1] < K:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

def solve():
    points = [0 for _ in range(N)]
    for a in A:
        points[a] += 1
    sum_points = sum(points)
    for p in points:
        if sum_points - p >= K:
            print('No')
        else:
            print('Yes')

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]


    N, K, Q = LMIIS()
    scores = [0] * N
    for _ in range(Q):
        a = II() - 1
        scores[a] += 1
    sumscore = sum(scores)

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



if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

for point in points:
    if point >b:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

import sys
input = sys.stdin.readline
A = [None] * Q
for i in range(Q):
    A[i] = int(input().rstrip())
    
peoples = [0] * N

for a in A:
    peoples[a-1] += 1
#print(peoples)

for p in peoples:
    if K-Q+p > 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)]

user = {i+1:0 for i in range(N)}

for aa in A:
    user[aa] += 1





for key,v in user.items():
    #非正当率がＫ以上なら
    if K-(Q-v) <= 0 :
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    N, K, Q = map(int, input().split())
    A = list()
    for i in range(Q):
        A.append(int(input()))

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

Submission status: Accepted

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

for itm in points:
    if itm <= 0: print('No')
    else: print('Yes')

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 x in point:
    if q>x>q-k:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=sys.stdin.readline
def resolve():
    n,k,q=map(int,input().split())
    S=[0]*n
    for _ in range(q):
        S[int(input())-1]+=1
    for i in range(n):
        print('Yes' if k>q-S[i] else 'No')


resolve()

Submission status: Accepted

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

must = Q - K + 1
part_l = [0 for _ in range(N)]

for A in A_l:
  part_l[A-1] += 1

for part in part_l:
  if(part<must):
    print("No")
  else:
    print("Yes")

Submission status: Accepted

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

for i, answer in enumerate(a):
    points[answer-1] += 1

for i, p in enumerate(points):
    result = "Yes" if k - q + p > 0 else "No"
    print(result)

Submission status: Accepted

Solution code:
import collections

N, K, Q = list(map(int, input().split()))
li = []
for i in range(Q):
    li.append(int(input())-1)

c = collections.Counter(li) 

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

Submission status: Accepted

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

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

for l in ls:
    if l - Q > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import sys
import math
from copy import deepcopy
from collections import deque, defaultdict
from operator import mul
from functools import reduce
sys.setrecursionlimit(20000000)

# input = sys.stdin.readline


def main():
    n, k, q = map(int, input().split())

    winners = []
    for w in range(q):
        winners.append(int(input()))

    score = [k - q] * n

    for w in winners:
        winner = w - 1

        score[winner] += 1

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

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



if __name__ == "__main__":
    main()

Submission status: Accepted

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

b = [0]*n

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

for i in range(n):
	minus_point = q - b[i]
	if k - minus_point > 0:
		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()))

import numpy as np
A = np.array(A) - 1

score = np.ones(shape=(N,)) * (K - Q)
for q in range(Q):
    score[A[q]] += 1

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

Submission status: Accepted

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