stablegradients/pie-gem5-pairs huggingface dataset:
// 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.390219421016712x):
#include <bits/stdc++.h>



using namespace std;

const int N=3e5+5;

int a[N];

int main()

{

    ios_base::sync_with_stdio(0);

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

    int n,k,q;

    cin>>n>>k>>q;

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

    {

        int x;

        cin>>x;

        a[x]++;

    }

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

    {

        if(k-q+a[i]>0) cout<<"Yes"<<'\n';

        else cout<<"No"<<'\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.3767975680702x):
#include <bits/stdc++.h>



using namespace std;

const int N=3e5+5;

int a[N];

int main()

{

    ios_base::sync_with_stdio(0);

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

    int n,k,q;

    cin>>n>>k>>q;

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

    {

        int x;

        cin>>x;

        a[x]++;

    }

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

    {

        if(k-q+a[i]>0) cout<<"Yes"<<'\n';

        else cout<<"No"<<'\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.7842858056165376x):
#include <bits/stdc++.h>



using namespace std;

const int N=3e5+5;

int a[N];

int main()

{

    ios_base::sync_with_stdio(0);

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

    int n,k,q;

    cin>>n>>k>>q;

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

    {

        int x;

        cin>>x;

        a[x]++;

    }

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

    {

        if(k-q+a[i]>0) cout<<"Yes"<<'\n';

        else cout<<"No"<<'\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.3812245121007787x):
#include <bits/stdc++.h>



using namespace std;

const int N=3e5+5;

int a[N];

int main()

{

    ios_base::sync_with_stdio(0);

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

    int n,k,q;

    cin>>n>>k>>q;

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

    {

        int x;

        cin>>x;

        a[x]++;

    }

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

    {

        if(k-q+a[i]>0) cout<<"Yes"<<'\n';

        else cout<<"No"<<'\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.397708031507788x):
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 25, M = 1e6 + 25, oo = 1e9+7, mxmsk = 1 << 16;

const long long OO = 1e18+25;

    

#define par pair<pair<int,int>, int>

#define f first

#define s second



int n,k,q,a[N],x;

int main() {

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

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

        scanf("%d",&x);

        a[x]++;

    }

    for(int i=1;i<=n;i++) printf("%s\n",(k-q+a[i]<=0?"No":"Yes"));

	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.6686506259994776x):
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 25, M = 1e6 + 25, oo = 1e9+7, mxmsk = 1 << 16;

const long long OO = 1e18+25;

    

#define par pair<pair<int,int>, int>

#define f first

#define s second



int n,k,q,a[N],x;

int main() {

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

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

        scanf("%d",&x);

        a[x]++;

    }

    for(int i=1;i<=n;i++) printf("%s\n",(k-q+a[i]<=0?"No":"Yes"));

	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.4075026942796052x):
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 25, M = 1e6 + 25, oo = 1e9+7, mxmsk = 1 << 16;

const long long OO = 1e18+25;

    

#define par pair<pair<int,int>, int>

#define f first

#define s second



int n,k,q,a[N],x;

int main() {

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

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

        scanf("%d",&x);

        a[x]++;

    }

    for(int i=1;i<=n;i++) printf("%s\n",(k-q+a[i]<=0?"No":"Yes"));

	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.393913980225658x):
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 25, M = 1e6 + 25, oo = 1e9+7, mxmsk = 1 << 16;

const long long OO = 1e18+25;

    

#define par pair<pair<int,int>, int>

#define f first

#define s second



int n,k,q,a[N],x;

int main() {

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

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

        scanf("%d",&x);

        a[x]++;

    }

    for(int i=1;i<=n;i++) printf("%s\n",(k-q+a[i]<=0?"No":"Yes"));

	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.8064681307167145x):
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 25, M = 1e6 + 25, oo = 1e9+7, mxmsk = 1 << 16;

const long long OO = 1e18+25;

    

#define par pair<pair<int,int>, int>

#define f first

#define s second



int n,k,q,a[N],x;

int main() {

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

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

        scanf("%d",&x);

        a[x]++;

    }

    for(int i=1;i<=n;i++) printf("%s\n",(k-q+a[i]<=0?"No":"Yes"));

	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.3983959602327474x):
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 25, M = 1e6 + 25, oo = 1e9+7, mxmsk = 1 << 16;

const long long OO = 1e18+25;

    

#define par pair<pair<int,int>, int>

#define f first

#define s second



int n,k,q,a[N],x;

int main() {

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

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

        scanf("%d",&x);

        a[x]++;

    }

    for(int i=1;i<=n;i++) printf("%s\n",(k-q+a[i]<=0?"No":"Yes"));

	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.3727457532126708x):
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long n,i,k,q,d,m;

    map<long long,long long>a;

    cin>>n>>k>>q;

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

    {

        cin>>m;

        a[m]++;

    }

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

    {

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

        if(d<=0)

            cout<<"No"<<endl;

        else

            cout<<"Yes"<<endl;

    }

}
// 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.531692844575184x):
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long n,i,k,q,d,m;

    map<long long,long long>a;

    cin>>n>>k>>q;

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

    {

        cin>>m;

        a[m]++;

    }

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

    {

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

        if(d<=0)

            cout<<"No"<<endl;

        else

            cout<<"Yes"<<endl;

    }

}
// 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.3823654888234462x):
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long n,i,k,q,d,m;

    map<long long,long long>a;

    cin>>n>>k>>q;

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

    {

        cin>>m;

        a[m]++;

    }

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

    {

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

        if(d<=0)

            cout<<"No"<<endl;

        else

            cout<<"Yes"<<endl;

    }

}
// 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.3690194615497426x):
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long n,i,k,q,d,m;

    map<long long,long long>a;

    cin>>n>>k>>q;

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

    {

        cin>>m;

        a[m]++;

    }

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

    {

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

        if(d<=0)

            cout<<"No"<<endl;

        else

            cout<<"Yes"<<endl;

    }

}
// 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.7742056272512619x):
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long n,i,k,q,d,m;

    map<long long,long long>a;

    cin>>n>>k>>q;

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

    {

        cin>>m;

        a[m]++;

    }

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

    {

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

        if(d<=0)

            cout<<"No"<<endl;

        else

            cout<<"Yes"<<endl;

    }

}
// 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.3734213959180235x):
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long n,i,k,q,d,m;

    map<long long,long long>a;

    cin>>n>>k>>q;

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

    {

        cin>>m;

        a[m]++;

    }

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

    {

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

        if(d<=0)

            cout<<"No"<<endl;

        else

            cout<<"Yes"<<endl;

    }

}
// 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.372526329270226x):
#include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main()

{





    ll i,j,k,a,b,c,n,t,m,q;

    vector<ll> v,s;

    map<ll,ll> ma,sa;

    string st,et;

    cin>>n>>k>>q;

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

        cin>>a;

        ma[a]++;

    }

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

        a = q-ma[i];

        //b = q-a;

        c = k-a;

        //cout<<a<<" "<<b<<" "<<c<<endl;

        if(c<=0){

            cout<<"No"<<endl;

        }

        else cout<<"Yes"<<endl;

    }

}
// 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.53048895541117x):
#include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main()

{





    ll i,j,k,a,b,c,n,t,m,q;

    vector<ll> v,s;

    map<ll,ll> ma,sa;

    string st,et;

    cin>>n>>k>>q;

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

        cin>>a;

        ma[a]++;

    }

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

        a = q-ma[i];

        //b = q-a;

        c = k-a;

        //cout<<a<<" "<<b<<" "<<c<<endl;

        if(c<=0){

            cout<<"No"<<endl;

        }

        else cout<<"Yes"<<endl;

    }

}
// 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.3821445272326x):
#include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main()

{





    ll i,j,k,a,b,c,n,t,m,q;

    vector<ll> v,s;

    map<ll,ll> ma,sa;

    string st,et;

    cin>>n>>k>>q;

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

        cin>>a;

        ma[a]++;

    }

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

        a = q-ma[i];

        //b = q-a;

        c = k-a;

        //cout<<a<<" "<<b<<" "<<c<<endl;

        if(c<=0){

            cout<<"No"<<endl;

        }

        else cout<<"Yes"<<endl;

    }

}
// 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.3688006332293245x):
#include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main()

{





    ll i,j,k,a,b,c,n,t,m,q;

    vector<ll> v,s;

    map<ll,ll> ma,sa;

    string st,et;

    cin>>n>>k>>q;

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

        cin>>a;

        ma[a]++;

    }

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

        a = q-ma[i];

        //b = q-a;

        c = k-a;

        //cout<<a<<" "<<b<<" "<<c<<endl;

        if(c<=0){

            cout<<"No"<<endl;

        }

        else cout<<"Yes"<<endl;

    }

}
// 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.773922032716347x):
#include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main()

{





    ll i,j,k,a,b,c,n,t,m,q;

    vector<ll> v,s;

    map<ll,ll> ma,sa;

    string st,et;

    cin>>n>>k>>q;

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

        cin>>a;

        ma[a]++;

    }

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

        a = q-ma[i];

        //b = q-a;

        c = k-a;

        //cout<<a<<" "<<b<<" "<<c<<endl;

        if(c<=0){

            cout<<"No"<<endl;

        }

        else cout<<"Yes"<<endl;

    }

}
// 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.3732018639787513x):
#include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main()

{





    ll i,j,k,a,b,c,n,t,m,q;

    vector<ll> v,s;

    map<ll,ll> ma,sa;

    string st,et;

    cin>>n>>k>>q;

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

        cin>>a;

        ma[a]++;

    }

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

        a = q-ma[i];

        //b = q-a;

        c = k-a;

        //cout<<a<<" "<<b<<" "<<c<<endl;

        if(c<=0){

            cout<<"No"<<endl;

        }

        else cout<<"Yes"<<endl;

    }

}
// 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.390538189405457x):
#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;

#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.629312643468858x):
#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<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.4002826083610145x):
#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;

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.3867636005203423x):
#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;

}