#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main( ) {
int N,K,Q;
cin >> N>> K>> Q;
vector< int > vec( N,K) ;
int ansp;
for ( int i= 0 ; i< Q; i++ ) {
cin >> ansp;
ansp= ansp- 1 ;
vec[ ansp] + = 1 ;
}
vector< int > v= vec.sort ( vec.begin ( ) ,vec.end ( ) ) ;
//int *max=v.end();
for ( int i= 0 ; i< N; i++ ) {
if ( v[ N- 1 ] - vec[ i] >= 0 ) cout << "Yes" << endl;
else cout << "No" << endl;
}
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CmludCBOLEssUTsKY2luPj5OPj5LPj5ROwp2ZWN0b3I8aW50PiB2ZWMoTixLKTsKaW50IGFuc3A7CmZvcihpbnQgaT0wOyBpPFE7IGkrKyl7CgljaW4+PmFuc3A7CglhbnNwPWFuc3AtMTsKCXZlY1thbnNwXSs9MTsKfQp2ZWN0b3I8aW50PiB2PXZlYy5zb3J0KHZlYy5iZWdpbigpLHZlYy5lbmQoKSk7Ci8vaW50ICptYXg9di5lbmQoKTsKZm9yKGludCBpPTA7IGk8TjsgaSsrKXsKCWlmKHZbTi0xXS12ZWNbaV0+PTApIGNvdXQ8PCJZZXMiPDxlbmRsOwoJZWxzZSAgICAgICAgICAgICAgY291dDw8Ik5vIjw8ZW5kbDsKfQp9