from collections import Counter





def solve(string):

    n, k, q, *a = list(map(int, string.split()))

    a = Counter(a)

    return "\n".join(["Yes" if a.get(i + 1, 0) > q - k else "No" for i in range(n)])





if __name__ == '__main__':

    n, m, q = list(map(int, input().split()))

    print((solve('{} {} {}\n'.format(n, m, q) + '\n'.join([eval(input()) for _ in range(q)]))))

def solve(string):

    n, k, q, *a = list(map(int, string.split()))

    t, b = [0] * n, q - k

    for _a in a:

        t[_a - 1] += 1

    return "\n".join(["Yes" if _t > b else "No" for _t in t])





if __name__ == '__main__':

    n, m, q = list(map(int, input().split()))

    print((solve('{} {} {}\n'.format(n, m, q) + '\n'.join([eval(input()) for _ in range(q)]))))

from collections import Counter


def solve(string):
    n, k, q, *a = list(map(int, string.split()))
    a = Counter(a)
    return "\n".join(["Yes" if a.get(i + 1, 0) > q - k else "No" for i in range(n)])


if __name__ == "__main__":
    n, m, q = list(map(int, input().split()))
    print(
        (
            solve(
                "{} {} {}\n".format(n, m, q)
                + "\n".join([eval(input()) for _ in range(q)])
            )
        )
    )

def solve(string):
    n, k, q, *a = list(map(int, string.split()))
    t, b = [0] * n, q - k
    for _a in a:
        t[_a - 1] += 1
    return "\n".join(["Yes" if _t > b else "No" for _t in t])


if __name__ == "__main__":
    n, m, q = list(map(int, input().split()))
    print(
        (
            solve(
                "{} {} {}\n".format(n, m, q)
                + "\n".join([eval(input()) for _ in range(q)])
            )
        )
    )

-from collections import Counter - - -    a = Counter(a) -    return "\n".join(["Yes" if a.get(i + 1, 0) > q - k else "No" for i in range(n)]) +    t, b = [0] * n, q - k +    for _a in a: +        t[_a - 1] += 1 +    return "\n".join(["Yes" if _t > b else "No" for _t in t])