Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
class Member:
    def __init__(self, answer):
        self.answer = answer
    def judge(self):
        if self.answer <= q-k:
            return 'No'
        else:
            return 'Yes'
for i in range(n):
    member_i = Member(a.count(i+1))
    print(member_i.judge())

Fixed submission:
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
p = [k for i in range(n)]
def judge(x):
    if p[x] - q <= 0:
        return 'No'
    else:
        return 'Yes'
for i in range(q):
    p[a[i] - 1] += 1
b = [judge(i) for i in range(n)]
print('\n'.join(b))

Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
class Member:
    def __init__(self, answer):
        self.answer = answer
    def judge(self):
        if self.answer <= q-k:
            return 'No'
        else:
            return 'Yes'  
members = [Member(a.count(i+1)) for i in range(n)]
for member in members:
    print(member.judge())

Fixed submission:
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
p = [k for i in range(n)]
def judge(x):
    if p[x] - q <= 0:
        return 'No'
    else:
        return 'Yes'
for i in range(q):
    p[a[i] - 1] += 1
b = [judge(i) for i in range(n)]
print('\n'.join(b))

Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
class Member:
    def __init__(self, answer, point):
        self.answer = answer
        self.point = point
    def judge(self):
        if self.point <= 0:
            return 'No'
        else:
            return 'Yes' 
members = [Member(a.count(i+1), k)
                  for i in range(n)]
for member in members:
    member.point = member.point - q + member.answer
    print(member.judge())

Fixed submission:
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
p = [k for i in range(n)]
def judge(x):
    if p[x] - q <= 0:
        return 'No'
    else:
        return 'Yes'
for i in range(q):
    p[a[i] - 1] += 1
b = [judge(i) for i in range(n)]
print('\n'.join(b))

Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]

class Member:
    def __init__(self, answer, point):
        self.answer = answer
        self.point = point
    def judge(self):
        if self.point <= 0:
            return 'No'
        else:
            return 'Yes'
        
members = [Member(a.count(i+1), k)
                  for i in range(n)]


for member in members:
    member.point = member.point - q + member.answer
    print(member.judge())

Fixed submission:
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
p = [k for i in range(n)]
def judge(x):
    if p[x] - q <= 0:
        return 'No'
    else:
        return 'Yes'
for i in range(q):
    p[a[i] - 1] += 1
b = [judge(i) for i in range(n)]
print('\n'.join(b))

Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
p = [k for i in range(n)]
def judge(x):
    if p[x] <= 0:
        return 'No'
    else:
        return 'Yes'
for j in range(q):
    for i in range(n):
     if i + 1 == a[j]:
        continue
     else:
        p[i] -= 1
b = [judge(i) for i in range(n)]
print('\n'.join(b))

Fixed submission:
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
p = [k for i in range(n)]
def judge(x):
    if p[x] - q <= 0:
        return 'No'
    else:
        return 'Yes'
for i in range(q):
    p[a[i] - 1] += 1
b = [judge(i) for i in range(n)]
print('\n'.join(b))