/*																													   
 Templatka c++ Kacper Fis																							   																											   //
*/																													  
																													   
#include <iostream>       	
#include <cstdio>         
#include <limits>		  
#include <cstdlib>       
#include <utility>        
#include <iterator>       
#include <bitset>         
#include <list>           
#include <vector>         
#include <map>            
#include <set>            														   
#include <queue>          																							   
#include <deque>          																							   
#include <stack>																									   
#include <algorithm>																								   
#include <cmath>																									   
#include <string>      																								   
#include <time.h>																									   
#include <iomanip> 																									   
#include <sstream>																									   
#include <bits/stdc++.h>																							   
																													   
using namespace std; 																								   
																													   
const int INF = 1000000001;																						   
const float PI = 3.14;																								   
typedef long long LL;																								   
																													   
typedef vector<int> vi;																								   
typedef list<int> li;																								   
typedef queue<int> qi; 																								   
typedef pair<int,int> ii; 																							   
typedef map<string,int> msi; //np msi['nazwa'] = 'liczba'															   
typedef vector<ii> vii; //vector par<int>, do tworzenia tablicy dla grafów wagowych #dijkstra #Bellman_Ford			   
typedef priority_queue< ii, vector<ii>, greater<ii> > pq; //kolejka priorytetowa vectorów par(top()=min) #dijkstra	   
																													   
list<int>::iterator it;																								   
list<int>::iterator it1;																							   
vector<int>::iterator it2;																							   
vector<int>::iterator it3;																							   
set<int>::iterator it4;																								   
map<string, int>::iterator it5; 																					   
vector<ii>::iterator iter;																							   
																													   																				   
#define print_list(x) for(it = (x).begin(); it != (x).end(); it++) {cout << *it << " ";}							   
#define print_vector(x) for(it2 = (x).begin(); it2 != (x).end(); it2++) {cout << *it2 << " ";}						   
#define search_list(x) for(it = (x).begin(); it != (x).end(); it++)													   
#define search_vector(x) for(it2 = (x).begin(); it2 != (x).end(); it2++);											   
#define pb(x) push_back(x) 																							   
#define pf(x) push_front(x)																							   
#define mp(x, y) make_pair(x, y)                                                                                       
///////////////////////////////////////////////GLOBAL DEFINITIONS////////////////////////////////////////////////////////



///////////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////



/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char* argv[])																					 
{ios_base::sync_with_stdio(false); cin.tie(NULL);                  												       
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
    
	int n, k, q;
	
	cin >> n >> k >> q;
	
	int *A = new int[q];
	int *points = new int[n];
	
	fill(A, A+q+1, 0);
	
	for(int i = 1; i <= n; i++)
    {
		points[i] = k;
	}
	
	//cout << "Points: "<< endl;
	//for(int i = 1; i <= n; i++)
	//{
		//cout << points[i] << " ";
	//}
	//cout << endl;
 
	for(int i = 1; i <= q; i++)
	{
		cin >> A[i];
		points[A[i]]++;
	}
	
	//cout << "Points after adding: "<< endl;
	//for(int i = 1; i <= n; i++)
	//{
		//cout << points[i] << " ";
	//}
	//cout << endl;
	
	for(int i = 1; i <= n; i++)
    {
		points[i] -= q;
	}
	
	//cout << "Points after removing: "<< endl;
	//for(int i = 1; i <= n; i++)
	//{
		//cout << points[i] << " ";
	//}
	
	for(int i = 1; i <=n ; i++)
	{
		if(points[i] > 0)
		cout << "Yes" << endl;
		else cout << "No" << endl;
	}
 
	
	
	
	return 0;
}


Measured memory_bytes: 1408