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

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

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

li = [0]*N

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


for num in li:
    if K>Q-num:
        print("Yes")
    else:
        print("No")

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

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


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

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

pts = [0 for _ in range(n)]
for i in range(q):
    pts[a[i] - 1] += 1

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

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

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

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

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

for l in li:
  print("No") if l <= 0 else print("Yes")

Solution (Python):
n,k,q, *aa = map(int, open(0).read().split())

scores = [k-q]*n

for a in aa:
    scores[a-1] += 1

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

Solution (Python):
from collections import Counter
n, k, q = map(int, input().split())
a = list(int(input()) for _ in range(q))
mycounter = Counter(a)
for i in range(n):
    ans = "Yes" if q - mycounter[i+1] < k else "No"
    print(ans)

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

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

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

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

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

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

Solution (Python):

N, K, Q = map(int,input().split())
Point = [K - Q] * N

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

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

Solution (Python):

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

Solution (Python):
N, K, Q = map(int, input().split())
answered = [0] * N
passed = 0

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

for point in answered:
    if point > Q - K:
        print('Yes')
    else:
        print('No')

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

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

for i in range(q):
    c[int(input())] += 1

for i in range(1,n+1) :
    if c[i]>0 :
        print("Yes")
    else :
        print("No")

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

point = [0]*n

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

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

Solution (Python):
import collections
N,K,Q = map(int,input().split())

A = [input() for i in range(Q)]

c = collections.Counter(A)

for i in range(1,N+1):

    if (Q-c[str(i)]) >=K:
        print('No')
    else:print('Yes')

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

Solution (Python):
import collections
N,K,Q = list(map(int,input().split()))
A = [ int(input()) for i in range(Q)]
cnt = collections.Counter(A)
ini_po = [K]*N
fi_po =[]
for i in range(N):
    t_po = ini_po[i]
    if i+1 in cnt:
        t_po += -Q + cnt[i+1]
    else:
        t_po -= Q
    if t_po >0:
        print('Yes')
    else:
        print('No')

Solution (Python):
N, K, Q = map(int, input().split())
win_count = [0 for _ in range(N)]
for _ in range(Q):
    win_count[int(input()) - 1] += 1
for i in range(N):
    if K - (Q - win_count[i]) > 0:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
import sys
input = sys.stdin.readline

n, k, q = [int(w) for w in input().split()]


score = [0] * n

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


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

Solution (Python):
"""
    こんにちは。これはクシャルです
    
    Author : thekushalghosh (クシャル)
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()



def solve():
    n,k,q = invr()
    w = []
    for i in range(q):
        a = inp()
        w.append(a)
    qw = counter(w,n)
    for i in range(n):
        if k - q + qw[i] <= 0:
            qw[i] = "No"
        else:
            qw[i] = "Yes"
    print(*qw,sep = "\n")
    


 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    

def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 

def counter(a,n):
    q = [0] * n
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97],1
    return(q)

def factors(n):
    q = []
    for i in range(1,int(n ** 0.5) + 1):
        if n % i == 0: q.append(i); q.append(n // i)
    return(list(sorted(list(set(q)))))

def prime_factors(n):
    q = []
    while n % 2 == 0: q.append(2); n = n // 2
    for i in range(3,int(n ** 0.5) + 1,2):
        while n % i == 0: q.append(i); n = n // i
    if n > 2: q.append(n)
    return(list(sorted(q)))


ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
main()

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

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

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

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

D=[0]*(N+1)
for _ in range(Q):
    D[int(input())]+=1

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

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


for n in range(N):
    if (Q-A[n]) >= K:
        print('No')
    else:
        print('Yes')

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

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

for out in charenger:
    if out > 0:
        print("Yes")
    else:
        print("No")

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

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

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

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

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

Solution (Python):
import math

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

Solution (Python):









import sys
input = sys.stdin.readline

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

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

Solution (Python):
N, K, Q = map(int, input().split())
cnt = [0] * N
for _ in range(Q):
    a = int(input())
    cnt[a-1] += 1
for c in cnt:
    if Q - c < K:
        print('Yes')
    else:
        print('No')

Solution (Python):
def INT():
    return int(input())

def MI():
    return map(int, input().split())

def LI():
    return list(map(int, input().split()))

N, K, Q = MI()
A = [K - Q] * N

for i in range(Q):
    A_i = INT()
    A[A_i - 1] += 1
    
for a in A:
    print("Yes" if a > 0 else "No")

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

point = [0 for i in range(n)]
for i in range(q):
    point[a[i] - 1] += 1

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

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


point = [K] * N


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


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

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

A = [0] * N
B = []

for i in range(Q):
    a_temp = int(input())
    B.append(a_temp)

for i in B:
    A[i-1] += 1

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

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

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

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

Solution (Python):
n,k,q = map(int, input().split())
corr = [k-q]*n

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

for c in corr:
    if c > 0:
        print('Yes')
    else:
        print('No')

Solution (Python):
import sys
import collections
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Solution (Python):
from collections import Counter as C
n,k,q=map(int, input().split())

a = [int(input()) for i in range(q)]

d=C(a)
len=len(a)
for i in range(1,n+1):
  try:
    if k - (len-d[i]) > 0:
      print("Yes")
    else:
      print("No")
  except:
    if k-len(a)>0:
      print("Yes")
    else:
      print("No")

Solution (Python):
def Convert(N):
    if N>0: return 'Yes'
    else: return 'No'

N,K,Q = (int(x) for x in input().split())
Win = [K-Q]*N
for T in range(0,Q):
    Win[int(input())-1] += 1
print('\n'.join(list(map(Convert,Win))))

Solution (Python):
n, k, q = map(int, input().split())
p = k - q
point = [k-q]*n

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

if k-q > 0:
    for _ in range(n):
        print('Yes')
    exit()

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

Solution (Python):
import numpy as np
N,K,Q = map(int,input().split())
ans=[0]*N
for i in range(Q):
    A = int(input())
    ans[A-1] += 1
ans=np.array(ans)-Q+K > 0
for i in ans:
    print("Yes" if i else "No")

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

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

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

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

for member in members:
    if Q - member < K:
        print("Yes")
    else:
        print("No")

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N, K, Q, *A = map(int, read().split())

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

    ans = [0] * N
    for i, b in enumerate(B):
        if Q >= K + b:
            ans[i] = 'No'
        else:
            ans[i] = 'Yes'

    print('\n'.join(map(str, ans)))
    return


if __name__ == '__main__':
    main()

Solution (Python):
from collections import Counter

def main():
    n, k, q = map(int, input().split())
    a = [int(input()) for i in range(q)]
    a_c = Counter(a)
    for i in range(1, n+1):
        if 0 < k + a_c.get(i, 0) - q:
            print('Yes')
        else:
            print('No')
    

if __name__ == '__main__':
    main()

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

ac=[0]*N
score=[]

for q in range(Q):
    ac[int(input())-1]+=1


for n in range(N):
    score.append(K-Q+ac[n])

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

Solution (Python):
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 C[i] + k - q <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
import numpy as np

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

a = np.array([0]*n)

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

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

Solution (Python):
import collections
N,K,Q=list(map(int,input().split()))
A=[]
point=[K-Q]*N
for i in range(Q):
    A.append(int(input()))
C=collections.Counter(A)
for i in range(N):
    point[i]+=C[i+1]
    if point[i]>0:
        print("Yes")
    else:
        print("No")

Solution (Python):
from collections import Counter

def main():
    n, k, q = map(int, input().split())
    a = [int(input()) for i in range(q)]
    a_c = Counter(a)
    for i in range(1, n+1):
        if q - a_c.get(i, 0) < k:
            print('Yes')
        else:
            print('No')

if __name__ == '__main__':
    main()

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

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

Solution (Python):
def main():
    N, K, Q = input_int_tuple()
    A = []
    for _ in range(Q):
        A.append(input_int())

    points = [0] * (N+1)

    for a in A:
        points[a] += 1

    for point in points[1:]:
        if K - (Q - point) > 0:
            print('Yes')
        else:
            print('No')


def input_int():
    return int(input())


def input_int_tuple():
    return map(int, input().split())


def input_int_list():
    return list(map(int, input().split()))


main()

Solution (Python):
def main():
    N, K, Q = input_int_tuple()
    A = []
    for i in range(Q):
        A.append(input_int())

    points = [0] * (N+1)

    for a in A:
        points[a] += 1

    for point in points[1:]:
        if K - (Q - point) > 0:
            print('Yes')
        else:
            print('No')


def input_int():
    return int(input())


def input_int_tuple():
    return map(int, input().split())


def input_int_list():
    return list(map(int, input().split()))


main()

Solution (Python):
def input_int():
    return int(input())


def input_int_tuple():
    return map(int, input().split())


def input_int_list():
    return list(map(int, input().split()))


N, K, Q = input_int_tuple()
A = []
for i in range(Q):
    A.append(input_int())

points = [0] * (N+1)

for a in A:
    points[a] += 1

for point in points[1:]:
    if K - (Q - point) > 0:
        print('Yes')
    else:
        print('No')

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

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

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

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

Solution (Python):
n,k,q,*l=map(int,open(0).read().split())
s=[k-q]*n
for i in l: s[i-1]+=1
for i in s: print('YNeos'[i<1::2])

Solution (Python):
n,k,q,*l=map(int,open(0).read().split())
s=[k-q]*n
for i in l: s[i-1]+=1
for i in s: print(['No','Yes'][i>0])

Solution (Python):
n ,k,q = map(int,input().split())
a = [int(input()) for i in range(q)]
point = [k-q]*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')

Solution (Python):

import math
from operator import add


def main():
    n, k, q = map(int, input().split())
    p = [k]*n
    a_l = [0]*n

    for _ in range(q):
        a = int(input())
        a_l[a-1] = a_l[a-1] + 1
    
    com = map(add, p, a_l)
    ans = ['Yes' if i > q else 'No' for i in com ]
    print(*ans)

if __name__ == '__main__':
    main()

Solution (Python):
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")

Solution (Python):
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

n,k,q = i2()
ls = [k-q]*n 
for _ in range(q):
	a = i()
	ls[a-1] += 1 

for j in range(n):
	if ls[j] > 0:
		print("Yes")
	else:
		print("No")

Solution (Python):

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



windic={i:0 for i in range(1,n+1)}
for i in range(q):
    a=int(input())
    windic[a]=windic[a]+1

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

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

l = list(map(lambda x: x - q, l))

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

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

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

Solution (Python):
from collections import Counter
import numpy as np
n,k,q=map(int,input().split())
a=[]
for i in range(q):
  a_=int(input())
  a.append(a_)
 
 
listn_=[]
for i in range(n):
  listn_.append(k)
listn=np.array(listn_)
listn=listn-q
s=Counter(a)
for i in s.keys():
  listn[i-1]+=s[i]
 

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

Solution (Python):
import sys
readline = sys.stdin.readline



N,K,Q = map(int,readline().split())
P = [0] * N
for i in range(Q):
  P[int(readline()) - 1] += 1

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

Solution (Python):
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a,b,c=mi()
l=[0]*a
for i in range(c):
  j=ii()
  l[j-1]+=1
for k in l:
  if b+k-c>0:
    print("Yes")
  else:
    print("No")

Solution (Python):
import collections

N,K,Q=map(int, input().split())
List=[int(input()) for i in range(Q)]
cc=collections.Counter(List)

points=[K-Q for i in range(N)]
for j in range(N):
    points[j]+=cc[j+1]

for p in points:
    if p>0:
        print('Yes')
    else:
        print('No')

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

count=[0]*N
i=0
while i<Q:
    count[A[i]-1]+=1
    i+=1

for c in count:
    if c+K-Q>0:
        print('Yes')
    else:
        print('No')

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

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

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

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

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

Solution (Python):
N,K,Q = map(int,input().split())
A = []
L = []
for i in range(N):
    A.append(K - Q)
for i in range(Q):
    L.append(int(input()))
for i in range(Q):
    j = L[i]
    A[j - 1] += 1

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

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

B = [K-Q] * N

for i in range(Q):
  A=int(input())
  
  B[A-1]+=1
  
  
for i in range(N):
  if(B[i]>=1):
  	print("Yes")
  else:
    print("No")

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

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

Solution (Python):

 

 
import sys
from fractions import gcd
import math
from math import ceil,floor
import collections
from collections import Counter
import itertools
 

 







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

point = []

for i in range(N):
    point.append(K-Q)

for j in range(Q):
    point[A[j]-1] += 1


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

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

point = [k]*n

for x in range(q):
    point[int(input())-1] += 1

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

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

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

Solution (Python):
n,k,q=map(int,input().split())
ans=[k-q]*n
h=[]
for i in range(q):
	h.append(int(input()))
for j in h:
	ans[j-1]+=1
for k in ans:
	if k>=1:
		print('Yes')
	else:
		print('No')

Solution (Python):
n,k,q=map(int,input().split())
ans=[k-q]*n
h=[]
for i in range(q):
	h.append(int(input()))
for j in h:
	ans[j-1]+=1
for k in ans:
	if k>=1:
		print('Yes')
	else:
		print('No')

Solution (Python):
def t(n):
  return n-c
a,b,c=map(int,input().split())
L=[b]*a
for i in range(c):
  P=int(input())
  L[P-1]+=1
L=list(map(t,L))
for i in range(a):
  if L[i]<=0:
    print("No")
  else:
    print("Yes")

Solution (Python):


import sys
input=sys.stdin.readline

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

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

Solution (Python):
import numpy as np

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

count_A = np.zeros(N)
for i in range(Q):
  count_A[A[i]-1] += 1

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

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

p=[0]*n

for a in A:
    p[a-1]+=1
    
for P in p:
    if q-P < k:
        print("Yes")
    else:
        print("No")

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

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

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

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

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


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

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

Solution (Python):
from collections import defaultdict
d = defaultdict(int)
n, k, q = map(int, input().split())
for i in range(q):
  d[int(input())] += 1

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

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

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

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

for i in val:
    if i - Q <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
n, k, q = map(int, input().split())
scores = [0]*(n+1)

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

Solution (Python):

from collections import Counter


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

if __name__ == '__main__':
    main()

Solution (Python):



import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline




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

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

Solution (Python):
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')

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
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')