stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

#define maxn 100005

using namespace std;



int a[maxn],b[maxn];



int main(){

	int n,k,q;

	cin>>n>>k>>q;

	

	memset(a,0,sizeof(a));

	memset(b,0,sizeof(b));

	

	for(int i=1;i<=q;i++){

		int flag;

		cin>>flag;

		b[flag]++;

	}

	

	for(int i=1;i<=n;i++){

	

		a[i] = k-(q-b[i]);

		

		if(a[i]<=0)

		 cout<<"No"<<endl;

		else

		  cout<<"Yes"<<endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.7972014663145932x):
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 1e7+5;

ll a[100005];

int main(){

	ll n,k,q;

	cin>>n>>k>>q;

	for(int i=1;i<=q;i++){

		int x;

		cin>>x;

		a[x]++;

	}

	for(int i=1;i<=n;i++){

		if(k-(q-a[i])<=0) cout<<"No"<<endl;

		else cout<<"Yes"<<endl;

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>



using namespace std;

const int N =100010;

int b[N];

int vis[N];

int main()

{

	int n,k,q;

	cin>>n>>k>>q;

	memset(vis,0,sizeof(vis));

	int id;

	for(int i=1;i<=q;i++) cin>>id,vis[id]++;

	for(int i=1;i<=n;i++) 

	{

		b[i]=k;

		b[i]=b[i]-(q-vis[i]);

		if(b[i]>=1)	puts("Yes");

		else puts("No");	

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.3912225892529795x):
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 1e7+5;

ll a[100005];

int main(){

	ll n,k,q;

	cin>>n>>k>>q;

	for(int i=1;i<=q;i++){

		int x;

		cin>>x;

		a[x]++;

	}

	for(int i=1;i<=n;i++){

		if(k-(q-a[i])<=0) cout<<"No"<<endl;

		else cout<<"Yes"<<endl;

	}

	return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<string.h>

#include<iostream>

using namespace std;

int main()

{

    int n,k,q,x;

    int a[100002]={0};

    cin>>n>>k>>q;

    for(int i=0;i<q;i++)

    {

        scanf("%d",&x);

        a[x]++;

    }

    for(int i=1;i<=n;i++)

    {

        if(a[i]+k-q>0)

            printf("Yes\n");

        else

            printf("No\n");

    }

}


// Faster C++ solution for the same problem (measured speedup: 1.393733716927803x):
#include <bits/stdc++.h>

using namespace std;

#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

typedef long long ll;



ll ans[100009];

int main()

{



   ll n,k,q;

   cin>>n>>k>>q;

   ll Q = q;

   while(q--)

   {

       ll a;

       cin>>a;

       ans[a]++;

   }





   for(int i=1;i<=n;i++)

   {

       ll temp = Q-ans[i];



       if(k-temp>0)

          cout<<"Yes"<<endl;

       else

          cout<<"No"<<endl;

   }







    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define ll long long

const int maxn=200000+100;



ll n,m,q,t[maxn<<2],x,y,z;

/*

ll low(ll x){

	return x&(-x);

}

ll query(ll x){

	ll res=0;

	for(;x>0;x-=low(x))res+=t[x];

	return res;

}

void updata(ll x,ll k){

	for(;x<=n;x+=low(x))t[x]+=k;

}*/



int main(){

	scanf("%lld%lld%lld",&n,&m,&q);

	memset(t,0,sizeof(t));

	for(int i=0;i<q;i++){

		scanf("%lld",&x);

		t[x]++;

	}

	for(int i=1;i<=n;i++){

		int k=t[i]+m-q;

		if(k<=0)printf("No\n");

		else printf("Yes\n");

	}

}

// Faster C++ solution for the same problem (measured speedup: 7.64684519217161x):
#include <bits/stdc++.h>

using namespace std;

#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

typedef long long ll;



ll ans[100009];

int main()

{



   ll n,k,q;

   cin>>n>>k>>q;

   ll Q = q;

   while(q--)

   {

       ll a;

       cin>>a;

       ans[a]++;

   }





   for(int i=1;i<=n;i++)

   {

       ll temp = Q-ans[i];



       if(k-temp>0)

          cout<<"Yes"<<endl;

       else

          cout<<"No"<<endl;

   }







    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<algorithm>

#include<string>

#include<cstring>

int a[100010];

using namespace std;

int main(){

	memset(a,0,sizeof a);

	int n,k,q,b;

	cin>>n>>k>>q;

	for(int i=0;i<q;i++){

		cin>>b;

		a[b]++;

	}

	for(int i=1;i<=n;i++){

		if((q-a[i])>=k) cout<<"No"<<endl;

		else cout<<"Yes"<<endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.4035005290540041x):
#include <bits/stdc++.h>

using namespace std;

#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

typedef long long ll;



ll ans[100009];

int main()

{



   ll n,k,q;

   cin>>n>>k>>q;

   ll Q = q;

   while(q--)

   {

       ll a;

       cin>>a;

       ans[a]++;

   }





   for(int i=1;i<=n;i++)

   {

       ll temp = Q-ans[i];



       if(k-temp>0)

          cout<<"Yes"<<endl;

       else

          cout<<"No"<<endl;

   }







    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn=1e5+100;

int main()

{

	int c[maxn],num[maxn],n,q,k,x;

	memset(num,0,sizeof num);

	scanf("%d%d%d",&n,&k,&q);

	for(int i=1;i<=q;i++)

	{

		scanf("%d",&x);

		num[x]++;

	}

	for(int i=1;i<=n;i++)

	{

		if(num[i]<=q-k) puts("No");

		else puts("Yes");

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.3899504538453453x):
#include <bits/stdc++.h>

using namespace std;

#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

typedef long long ll;



ll ans[100009];

int main()

{



   ll n,k,q;

   cin>>n>>k>>q;

   ll Q = q;

   while(q--)

   {

       ll a;

       cin>>a;

       ans[a]++;

   }





   for(int i=1;i<=n;i++)

   {

       ll temp = Q-ans[i];



       if(k-temp>0)

          cout<<"Yes"<<endl;

       else

          cout<<"No"<<endl;

   }







    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define maxn 100005

using namespace std;



int a[maxn],b[maxn];



int main(){

	int n,k,q;

	cin>>n>>k>>q;

	

	memset(a,0,sizeof(a));

	memset(b,0,sizeof(b));

	

	for(int i=1;i<=q;i++){

		int flag;

		cin>>flag;

		b[flag]++;

	}

	

	for(int i=1;i<=n;i++){

	

		a[i] = k-(q-b[i]);

		

		if(a[i]<=0)

		 cout<<"No"<<endl;

		else

		  cout<<"Yes"<<endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.8013315267419623x):
#include <bits/stdc++.h>

using namespace std;

#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

typedef long long ll;



ll ans[100009];

int main()

{



   ll n,k,q;

   cin>>n>>k>>q;

   ll Q = q;

   while(q--)

   {

       ll a;

       cin>>a;

       ans[a]++;

   }





   for(int i=1;i<=n;i++)

   {

       ll temp = Q-ans[i];



       if(k-temp>0)

          cout<<"Yes"<<endl;

       else

          cout<<"No"<<endl;

   }







    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>



using namespace std;

const int N =100010;

int b[N];

int vis[N];

int main()

{

	int n,k,q;

	cin>>n>>k>>q;

	memset(vis,0,sizeof(vis));

	int id;

	for(int i=1;i<=q;i++) cin>>id,vis[id]++;

	for(int i=1;i<=n;i++) 

	{

		b[i]=k;

		b[i]=b[i]-(q-vis[i]);

		if(b[i]>=1)	puts("Yes");

		else puts("No");	

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.3944196895610035x):
#include <bits/stdc++.h>

using namespace std;

#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

typedef long long ll;



ll ans[100009];

int main()

{



   ll n,k,q;

   cin>>n>>k>>q;

   ll Q = q;

   while(q--)

   {

       ll a;

       cin>>a;

       ans[a]++;

   }





   for(int i=1;i<=n;i++)

   {

       ll temp = Q-ans[i];



       if(k-temp>0)

          cout<<"Yes"<<endl;

       else

          cout<<"No"<<endl;

   }







    return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<string.h>

#include<iostream>

using namespace std;

int main()

{

    int n,k,q,x;

    int a[100002]={0};

    cin>>n>>k>>q;

    for(int i=0;i<q;i++)

    {

        scanf("%d",&x);

        a[x]++;

    }

    for(int i=1;i<=n;i++)

    {

        if(a[i]+k-q>0)

            printf("Yes\n");

        else

            printf("No\n");

    }

}


// Faster C++ solution for the same problem (measured speedup: 1.411715621892838x):
#include<bits/stdc++.h>

using namespace std;

long long n,k,q;

long long a[200005],cnt[200005];

int main()

{

    scanf("%lld%lld%lld",&n,&k,&q);	

    for(int i=1;i<=q;++i)

        scanf("%lld",&a[i]),cnt[a[i]] ++;

    for(int i=1;i<=n;++i)

    {

    	if(k-(q-cnt[i]) <= 0) printf("No\n");

    	else printf("Yes\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define ll long long

const int maxn=200000+100;



ll n,m,q,t[maxn<<2],x,y,z;

/*

ll low(ll x){

	return x&(-x);

}

ll query(ll x){

	ll res=0;

	for(;x>0;x-=low(x))res+=t[x];

	return res;

}

void updata(ll x,ll k){

	for(;x<=n;x+=low(x))t[x]+=k;

}*/



int main(){

	scanf("%lld%lld%lld",&n,&m,&q);

	memset(t,0,sizeof(t));

	for(int i=0;i<q;i++){

		scanf("%lld",&x);

		t[x]++;

	}

	for(int i=1;i<=n;i++){

		int k=t[i]+m-q;

		if(k<=0)printf("No\n");

		else printf("Yes\n");

	}

}

// Faster C++ solution for the same problem (measured speedup: 7.7455045284981106x):
#include<bits/stdc++.h>

using namespace std;

long long n,k,q;

long long a[200005],cnt[200005];

int main()

{

    scanf("%lld%lld%lld",&n,&k,&q);	

    for(int i=1;i<=q;++i)

        scanf("%lld",&a[i]),cnt[a[i]] ++;

    for(int i=1;i<=n;++i)

    {

    	if(k-(q-cnt[i]) <= 0) printf("No\n");

    	else printf("Yes\n");

	}

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<algorithm>

#include<string>

#include<cstring>

int a[100010];

using namespace std;

int main(){

	memset(a,0,sizeof a);

	int n,k,q,b;

	cin>>n>>k>>q;

	for(int i=0;i<q;i++){

		cin>>b;

		a[b]++;

	}

	for(int i=1;i<=n;i++){

		if((q-a[i])>=k) cout<<"No"<<endl;

		else cout<<"Yes"<<endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.4216084450965725x):
#include<bits/stdc++.h>

using namespace std;

long long n,k,q;

long long a[200005],cnt[200005];

int main()

{

    scanf("%lld%lld%lld",&n,&k,&q);	

    for(int i=1;i<=q;++i)

        scanf("%lld",&a[i]),cnt[a[i]] ++;

    for(int i=1;i<=n;++i)

    {

    	if(k-(q-cnt[i]) <= 0) printf("No\n");

    	else printf("Yes\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn=1e5+100;

int main()

{

	int c[maxn],num[maxn],n,q,k,x;

	memset(num,0,sizeof num);

	scanf("%d%d%d",&n,&k,&q);

	for(int i=1;i<=q;i++)

	{

		scanf("%d",&x);

		num[x]++;

	}

	for(int i=1;i<=n;i++)

	{

		if(num[i]<=q-k) puts("No");

		else puts("Yes");

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.4078835472788946x):
#include<bits/stdc++.h>

using namespace std;

long long n,k,q;

long long a[200005],cnt[200005];

int main()

{

    scanf("%lld%lld%lld",&n,&k,&q);	

    for(int i=1;i<=q;++i)

        scanf("%lld",&a[i]),cnt[a[i]] ++;

    for(int i=1;i<=n;++i)

    {

    	if(k-(q-cnt[i]) <= 0) printf("No\n");

    	else printf("Yes\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define maxn 100005

using namespace std;



int a[maxn],b[maxn];



int main(){

	int n,k,q;

	cin>>n>>k>>q;

	

	memset(a,0,sizeof(a));

	memset(b,0,sizeof(b));

	

	for(int i=1;i<=q;i++){

		int flag;

		cin>>flag;

		b[flag]++;

	}

	

	for(int i=1;i<=n;i++){

	

		a[i] = k-(q-b[i]);

		

		if(a[i]<=0)

		 cout<<"No"<<endl;

		else

		  cout<<"Yes"<<endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.8245722447722295x):
#include<bits/stdc++.h>

using namespace std;

long long n,k,q;

long long a[200005],cnt[200005];

int main()

{

    scanf("%lld%lld%lld",&n,&k,&q);	

    for(int i=1;i<=q;++i)

        scanf("%lld",&a[i]),cnt[a[i]] ++;

    for(int i=1;i<=n;++i)

    {

    	if(k-(q-cnt[i]) <= 0) printf("No\n");

    	else printf("Yes\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>



using namespace std;

const int N =100010;

int b[N];

int vis[N];

int main()

{

	int n,k,q;

	cin>>n>>k>>q;

	memset(vis,0,sizeof(vis));

	int id;

	for(int i=1;i<=q;i++) cin>>id,vis[id]++;

	for(int i=1;i<=n;i++) 

	{

		b[i]=k;

		b[i]=b[i]-(q-vis[i]);

		if(b[i]>=1)	puts("Yes");

		else puts("No");	

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.4124104449215975x):
#include<bits/stdc++.h>

using namespace std;

long long n,k,q;

long long a[200005],cnt[200005];

int main()

{

    scanf("%lld%lld%lld",&n,&k,&q);	

    for(int i=1;i<=q;++i)

        scanf("%lld",&a[i]),cnt[a[i]] ++;

    for(int i=1;i<=n;++i)

    {

    	if(k-(q-cnt[i]) <= 0) printf("No\n");

    	else printf("Yes\n");

	}

	return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<string.h>

#include<iostream>

using namespace std;

int main()

{

    int n,k,q,x;

    int a[100002]={0};

    cin>>n>>k>>q;

    for(int i=0;i<q;i++)

    {

        scanf("%d",&x);

        a[x]++;

    }

    for(int i=1;i<=n;i++)

    {

        if(a[i]+k-q>0)

            printf("Yes\n");

        else

            printf("No\n");

    }

}


// Faster C++ solution for the same problem (measured speedup: 1.381481881849561x):
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

using ii = pair<int, int>;

using iii = pair<ii, int>;

#define vt vector

#define pq priority_queue

#define pb push_back

#define pf push_front

#define mp make_pair

#define fi first

#define se second

#define __lcm(a, b) a * b / __gcd(a, b)

// #define multicase

const int MOD = 1e9 + 7;

const int INF = 2e9;

const int N = 1e5 + 5;



int n, k, q;

int a[N];



void solve() {

    int T = 1;

  #ifdef multicase

    cin >> T;

  #endif

    for(int tc = 1; tc <= T; tc++) {

        cin >> n >> k >> q;

        for(int i = 1; i <= n; i++) {

            a[i] = k;

        }

        for(int i = 1, x; i <= q; i++) {

            cin >> x;

            a[x]++;

        }

        for(int i = 1; i <= n; i++) {

            cout << (a[i] - q <= 0 ? "No\n" : "Yes\n");

        }

    }

}



int main() {



    ios_base::sync_with_stdio(0);

    cin.tie(0); cout.tie(0);



    solve();

    

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define ll long long

const int maxn=200000+100;



ll n,m,q,t[maxn<<2],x,y,z;

/*

ll low(ll x){

	return x&(-x);

}

ll query(ll x){

	ll res=0;

	for(;x>0;x-=low(x))res+=t[x];

	return res;

}

void updata(ll x,ll k){

	for(;x<=n;x+=low(x))t[x]+=k;

}*/



int main(){

	scanf("%lld%lld%lld",&n,&m,&q);

	memset(t,0,sizeof(t));

	for(int i=0;i<q;i++){

		scanf("%lld",&x);

		t[x]++;

	}

	for(int i=1;i<=n;i++){

		int k=t[i]+m-q;

		if(k<=0)printf("No\n");

		else printf("Yes\n");

	}

}

// Faster C++ solution for the same problem (measured speedup: 7.579624398826775x):
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

using ii = pair<int, int>;

using iii = pair<ii, int>;

#define vt vector

#define pq priority_queue

#define pb push_back

#define pf push_front

#define mp make_pair

#define fi first

#define se second

#define __lcm(a, b) a * b / __gcd(a, b)

// #define multicase

const int MOD = 1e9 + 7;

const int INF = 2e9;

const int N = 1e5 + 5;



int n, k, q;

int a[N];



void solve() {

    int T = 1;

  #ifdef multicase

    cin >> T;

  #endif

    for(int tc = 1; tc <= T; tc++) {

        cin >> n >> k >> q;

        for(int i = 1; i <= n; i++) {

            a[i] = k;

        }

        for(int i = 1, x; i <= q; i++) {

            cin >> x;

            a[x]++;

        }

        for(int i = 1; i <= n; i++) {

            cout << (a[i] - q <= 0 ? "No\n" : "Yes\n");

        }

    }

}



int main() {



    ios_base::sync_with_stdio(0);

    cin.tie(0); cout.tie(0);



    solve();

    

}
// Slower C++ solution:
#include<iostream>

#include<algorithm>

#include<string>

#include<cstring>

int a[100010];

using namespace std;

int main(){

	memset(a,0,sizeof a);

	int n,k,q,b;

	cin>>n>>k>>q;

	for(int i=0;i<q;i++){

		cin>>b;

		a[b]++;

	}

	for(int i=1;i<=n;i++){

		if((q-a[i])>=k) cout<<"No"<<endl;

		else cout<<"Yes"<<endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.3911628372802136x):
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

using ii = pair<int, int>;

using iii = pair<ii, int>;

#define vt vector

#define pq priority_queue

#define pb push_back

#define pf push_front

#define mp make_pair

#define fi first

#define se second

#define __lcm(a, b) a * b / __gcd(a, b)

// #define multicase

const int MOD = 1e9 + 7;

const int INF = 2e9;

const int N = 1e5 + 5;



int n, k, q;

int a[N];



void solve() {

    int T = 1;

  #ifdef multicase

    cin >> T;

  #endif

    for(int tc = 1; tc <= T; tc++) {

        cin >> n >> k >> q;

        for(int i = 1; i <= n; i++) {

            a[i] = k;

        }

        for(int i = 1, x; i <= q; i++) {

            cin >> x;

            a[x]++;

        }

        for(int i = 1; i <= n; i++) {

            cout << (a[i] - q <= 0 ? "No\n" : "Yes\n");

        }

    }

}



int main() {



    ios_base::sync_with_stdio(0);

    cin.tie(0); cout.tie(0);



    solve();

    

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn=1e5+100;

int main()

{

	int c[maxn],num[maxn],n,q,k,x;

	memset(num,0,sizeof num);

	scanf("%d%d%d",&n,&k,&q);

	for(int i=1;i<=q;i++)

	{

		scanf("%d",&x);

		num[x]++;

	}

	for(int i=1;i<=n;i++)

	{

		if(num[i]<=q-k) puts("No");

		else puts("Yes");

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.3777318761352657x):
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

using ii = pair<int, int>;

using iii = pair<ii, int>;

#define vt vector

#define pq priority_queue

#define pb push_back

#define pf push_front

#define mp make_pair

#define fi first

#define se second

#define __lcm(a, b) a * b / __gcd(a, b)

// #define multicase

const int MOD = 1e9 + 7;

const int INF = 2e9;

const int N = 1e5 + 5;



int n, k, q;

int a[N];



void solve() {

    int T = 1;

  #ifdef multicase

    cin >> T;

  #endif

    for(int tc = 1; tc <= T; tc++) {

        cin >> n >> k >> q;

        for(int i = 1; i <= n; i++) {

            a[i] = k;

        }

        for(int i = 1, x; i <= q; i++) {

            cin >> x;

            a[x]++;

        }

        for(int i = 1; i <= n; i++) {

            cout << (a[i] - q <= 0 ? "No\n" : "Yes\n");

        }

    }

}



int main() {



    ios_base::sync_with_stdio(0);

    cin.tie(0); cout.tie(0);



    solve();

    

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define maxn 100005

using namespace std;



int a[maxn],b[maxn];



int main(){

	int n,k,q;

	cin>>n>>k>>q;

	

	memset(a,0,sizeof(a));

	memset(b,0,sizeof(b));

	

	for(int i=1;i<=q;i++){

		int flag;

		cin>>flag;

		b[flag]++;

	}

	

	for(int i=1;i<=n;i++){

	

		a[i] = k-(q-b[i]);

		

		if(a[i]<=0)

		 cout<<"No"<<endl;

		else

		  cout<<"Yes"<<endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.7854966391168512x):
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

using ii = pair<int, int>;

using iii = pair<ii, int>;

#define vt vector

#define pq priority_queue

#define pb push_back

#define pf push_front

#define mp make_pair

#define fi first

#define se second

#define __lcm(a, b) a * b / __gcd(a, b)

// #define multicase

const int MOD = 1e9 + 7;

const int INF = 2e9;

const int N = 1e5 + 5;



int n, k, q;

int a[N];



void solve() {

    int T = 1;

  #ifdef multicase

    cin >> T;

  #endif

    for(int tc = 1; tc <= T; tc++) {

        cin >> n >> k >> q;

        for(int i = 1; i <= n; i++) {

            a[i] = k;

        }

        for(int i = 1, x; i <= q; i++) {

            cin >> x;

            a[x]++;

        }

        for(int i = 1; i <= n; i++) {

            cout << (a[i] - q <= 0 ? "No\n" : "Yes\n");

        }

    }

}



int main() {



    ios_base::sync_with_stdio(0);

    cin.tie(0); cout.tie(0);



    solve();

    

}
// Slower C++ solution:
#include<bits/stdc++.h>



using namespace std;

const int N =100010;

int b[N];

int vis[N];

int main()

{

	int n,k,q;

	cin>>n>>k>>q;

	memset(vis,0,sizeof(vis));

	int id;

	for(int i=1;i<=q;i++) cin>>id,vis[id]++;

	for(int i=1;i<=n;i++) 

	{

		b[i]=k;

		b[i]=b[i]-(q-vis[i]);

		if(b[i]>=1)	puts("Yes");

		else puts("No");	

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.3821618243326204x):
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

using ii = pair<int, int>;

using iii = pair<ii, int>;

#define vt vector

#define pq priority_queue

#define pb push_back

#define pf push_front

#define mp make_pair

#define fi first

#define se second

#define __lcm(a, b) a * b / __gcd(a, b)

// #define multicase

const int MOD = 1e9 + 7;

const int INF = 2e9;

const int N = 1e5 + 5;



int n, k, q;

int a[N];



void solve() {

    int T = 1;

  #ifdef multicase

    cin >> T;

  #endif

    for(int tc = 1; tc <= T; tc++) {

        cin >> n >> k >> q;

        for(int i = 1; i <= n; i++) {

            a[i] = k;

        }

        for(int i = 1, x; i <= q; i++) {

            cin >> x;

            a[x]++;

        }

        for(int i = 1; i <= n; i++) {

            cout << (a[i] - q <= 0 ? "No\n" : "Yes\n");

        }

    }

}



int main() {



    ios_base::sync_with_stdio(0);

    cin.tie(0); cout.tie(0);



    solve();

    

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int n,k,q,a[100010]={0};

    cin>>n>>k>>q;

    for(int i=1;i<=q;i++)

    {

        int x;

        cin>>x;

        a[x]++;

    }

    for(int i=1;i<=n;i++)

        if(k-(q-a[i])<=0)

            cout<<"No"<<endl;

        else

            cout<<"Yes"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.4109737130739586x):
#include <bits/stdc++.h>

using namespace std;



const int MAXN = 100005;



int N, K, Q, ai, A[MAXN];

int main(){

	scanf("%d %d %d", &N, &K, &Q);

	for(int i = 0; i < Q; i++){

		scanf("%d", &ai);

		A[ai - 1]++;

	}

	for(int i = 0; i < N; i++){

		if(K - Q + A[i] > 0)printf("Yes\n");

		else printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<iostream>

#include<math.h>

#include<algorithm>

using namespace std;

int main()

{

int N;

long long K,Q;

long long a[500005]={0};

cin>>N;

cin>>K;

cin>>Q;

for(int i=1;i<=N;i++)

{a[i]+=K; a[i]-=Q; }

for(int i=1;i<=Q;i++)

{

    int op;

    cin>>op;

    a[op]++;

}

for(int j=1;j<=N;j++)

{

    if(a[j]>0)

        printf("Yes\n");

    else

        printf("No\n");

}

return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.158480712839709x):
#include <bits/stdc++.h>

using namespace std;



const int MAXN = 100005;



int N, K, Q, ai, A[MAXN];

int main(){

	scanf("%d %d %d", &N, &K, &Q);

	for(int i = 0; i < Q; i++){

		scanf("%d", &ai);

		A[ai - 1]++;

	}

	for(int i = 0; i < N; i++){

		if(K - Q + A[i] > 0)printf("Yes\n");

		else printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int n,k,q,a[100010]={0};

    cin>>n>>k>>q;

    for(int i=1;i<=q;i++)

    {

        int x;

        cin>>x;

        a[x]++;

    }

    for(int i=1;i<=n;i++)

        if(k-(q-a[i])<=0)

            cout<<"No"<<endl;

        else

            cout<<"Yes"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.4126583598368212x):
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 3;

int n, k, q, freq[N];

int main() {

#ifndef ONLINE_JUDGE

//	freopen("input.in", "r", stdin);

#endif

	scanf("%d %d %d", &n, &k, &q);

	for (int i = 0; i< q; ++i) {

		int a;

		scanf("%d", &a);

		++freq[a];

	}

	for (int i = 1; i <=n; ++i) {

		if (k - (q - freq[i]) > 0) {

			puts("Yes");

		}else {

			puts("No");

		}

	}

	return 0;

}