Buggy python submission (verdict: Runtime Error):
n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
#if q-k<0:
 #   for i in range(n):
  #      print('Yes')
#else:
c = collections.Counter(a)
for i in range(n):
    #print(k-c[str(i+1)])
    if q-c[str(i+1)]<k:
        print('Yes')
    else:
        print('No')

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

Buggy python submission (verdict: Runtime Error):
n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
if q-k<0:
    for i in range(n):
        print('Yes')
else:
    c = collections.Counter(a)
    for i in range(n):
        if c[str(i+1)]>q-k:
            print('Yes')
        else:
            print('No')

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

Buggy python submission (verdict: Runtime Error):
n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
if q-k<0:
    for i in range(n):
        print('Yes')
else:
    c = collections.Counter(a)
    for i in range(n):
        if c[str(i)]>q-k:
            print('Yes')
        else:
            print('No')

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

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
if q-k<0:
    for i in range(n):
        print('Yes')
else:
    import collections
    c = collections.Counter(a)
    if c.most_common()[0][1]>=k:# and q-c.most_common()[0][1]<=k:
        a=int(c.most_common()[0][0])
        for i in range(n):
            if i+1==a:
                print('Yes')
            else:
                print('No')
    else:
        l=([int(i[0]) for i in c.items() if i[1] > q-k])
        #print(l)
        for i in range(n):
            if l.count(i+1)>0:
                print('Yes')
            else:
                print('No')

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

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
if q-k<0:
    for i in range(n):
        print('Yes')
else:
    import collections
    c = collections.Counter(a)
    if c.most_common()[0][1]>=k and q-c.most_common()[0][1]<=k:
        a=int(c.most_common()[0][0])
        for i in range(n):
            if i+1==a:
                print('Yes')
            else:
                print('No')
    else:
        l=([int(i[0]) for i in c.items() if i[1] > q-k])
        #print(l)
        for i in range(n):
            if l.count(i+1)>0:
                print('Yes')
            else:
                print('No')

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

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
if q-k<0:
    for i in range(n):
        print('Yes')
else:
    import collections
    c = collections.Counter(a)
    l=([int(i[0]) for i in c.items() if i[1] > q-k])
    #print(l)
    for i in range(n):
        if l.count(i+1)>0:
            print('Yes')
        else:
            print('No')

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

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
if q-k<0:
    for i in range(n):
        print('Yes')
else:
    import collections
    c = collections.Counter(a)
    l=([int(i[0]) for i in c.items() if i[1] > q-k])
    #print(l)
    for i in range(n):
        if l.count(i+1)>0:
            print('Yes')
        else:
            print('No')

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

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
import collections
c = collections.Counter(a)
l=([int(i[0]) for i in c.items() if i[1] > q-k])
#print(l)
for i in range(n):
    if l.count(i+1)>0:
        print('Yes')
    elif q-k<0:
        print('Yes')
    else:
        print('No')

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