stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<algorithm>

#include <cstring>

using namespace std;

int main()

{

    int t=1,i=0,n,q,a[100005],N[100005]= {0},maxl=0,d;

    long long k;

    cin>>n>>k>>q;

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

    {

        cin>>a[i];

        N[a[i]]++;

    }

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

        if(N[i]>N[maxl])

            maxl=i;

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

        if(a[i]!=maxl)

            --k;

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

        if(N[i]+k-N[maxl]<=0)

            cout<<"No\n";

        else

            cout<<"Yes\n";

    return 0;

}




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

using namespace std;



long long arr[10000001];

long long a,b,c,d,e;



int main() {

	cin>>a>>b>>c;

	for(long long i=0;i<c;i++) {

		cin>>d;

		arr[d]++;

	}

	for(long long i=1;i<=a;i++) {

		e=b-c+arr[i];

		if(e>0) cout<<"Yes";

		else cout<<"No";;

		cout<<"\n";

	}

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

#define ll long long

#define ull unsinged long long

#define ld long double

#define mem(a,b) memset(a,b,sizeof(a))

#define inf (1LL<<62)

#define sf scanf

#define pf printf

#define repi(i,a,b) for(int i=a;i<=b;++i)

#define rep(i,a,b) for(ll i=a;i<=b;++i)

#define depi(i,a,b) for(int i=a;i>=b;--i)

#define dep(i,a,b) for(ll i=a;i>=b;--i)

#define mod 1000000007



using namespace std;



int ans[100005];



int main()

{

    //std::ios::sync_with_stdio(false);

    int n,k,q,s;

    mem(ans,0);

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

    int m=q-k;

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

    {

        sf("%d",&s);

        ++ans[s];

    }

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

    {

        if(ans[i]<=m)

            pf("No\n");

        else

            pf("Yes\n");

    }



    return 0;

}


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

#include<cstdio>

#include<iostream>

#include<cmath>

#include<bits/stdc++.h>

using namespace std;

int ss[112345],s1[112345];

int main()

{

	int n,k,q,i;

	cin>>n>>k>>q;

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

		cin>>s1[i];

	}

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

		ss[i]=k-q;

	}

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

		ss[s1[i]-1]++;

	}

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

		if(ss[i]>0)	cout<<"Yes"<<endl;

		else	cout<<"No"<<endl;

	}

	return 0;

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

#include<cstdio>

#include<algorithm>

#include <cstring>

using namespace std;

int main()

{

    int t=1,i=0,n,q,a[100005],N[100005]= {0},maxl=0,d;

    long long k;

    cin>>n>>k>>q;

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

    {

        cin>>a[i];

        N[a[i]]++;

    }

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

        if(N[i]>N[maxl])

            maxl=i;

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

        if(a[i]!=maxl)

            --k;

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

        if(N[i]+k-N[maxl]<=0)

            cout<<"No\n";

        else

            cout<<"Yes\n";

    return 0;

}




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

#include<cstdio>

#include<iostream>

#include<cmath>

#include<bits/stdc++.h>

using namespace std;

int ss[112345],s1[112345];

int main()

{

	int n,k,q,i;

	cin>>n>>k>>q;

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

		cin>>s1[i];

	}

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

		ss[i]=k-q;

	}

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

		ss[s1[i]-1]++;

	}

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

		if(ss[i]>0)	cout<<"Yes"<<endl;

		else	cout<<"No"<<endl;

	}

	return 0;

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

#define ll long long

#define ull unsinged long long

#define ld long double

#define mem(a,b) memset(a,b,sizeof(a))

#define inf (1LL<<62)

#define sf scanf

#define pf printf

#define repi(i,a,b) for(int i=a;i<=b;++i)

#define rep(i,a,b) for(ll i=a;i<=b;++i)

#define depi(i,a,b) for(int i=a;i>=b;--i)

#define dep(i,a,b) for(ll i=a;i>=b;--i)

#define mod 1000000007



using namespace std;



int ans[100005];



int main()

{

    //std::ios::sync_with_stdio(false);

    int n,k,q,s;

    mem(ans,0);

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

    int m=q-k;

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

    {

        sf("%d",&s);

        ++ans[s];

    }

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

    {

        if(ans[i]<=m)

            pf("No\n");

        else

            pf("Yes\n");

    }



    return 0;

}


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

using namespace std;



int val[100010];





int main()

{

	int n,k,q;

	cin>>n>>k>>q;

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

		val[i]=k-q;

	int x;

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

	{

		scanf("%d",&x);

		val[x]++;

	}

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

	{

		if(val[i] <= 0)

			puts("No");

		else puts("Yes");

	}

	return 0;

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

#include<cstdio>

#include<algorithm>

#include <cstring>

using namespace std;

int main()

{

    int t=1,i=0,n,q,a[100005],N[100005]= {0},maxl=0,d;

    long long k;

    cin>>n>>k>>q;

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

    {

        cin>>a[i];

        N[a[i]]++;

    }

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

        if(N[i]>N[maxl])

            maxl=i;

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

        if(a[i]!=maxl)

            --k;

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

        if(N[i]+k-N[maxl]<=0)

            cout<<"No\n";

        else

            cout<<"Yes\n";

    return 0;

}




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

using namespace std;



int val[100010];





int main()

{

	int n,k,q;

	cin>>n>>k>>q;

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

		val[i]=k-q;

	int x;

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

	{

		scanf("%d",&x);

		val[x]++;

	}

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

	{

		if(val[i] <= 0)

			puts("No");

		else puts("Yes");

	}

	return 0;

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

using namespace std;

typedef long long ll;

const int MAXN = 1e5 + 10;



ll s[MAXN];



int main() {

	ios::sync_with_stdio(false);

	ll n, k, q, a;

	while(cin >> n >> k >> q) {

		memset(s, 0, sizeof(s));

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

			cin >> a;

			s[a]++;

		}

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

			if(s[i] > q - k) {

				cout << "Yes\n";

			} else {

				cout << "No\n";

			}

		}

	}

	return 0;

}

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

using namespace std;



int val[100010];





int main()

{

	int n,k,q;

	cin>>n>>k>>q;

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

		val[i]=k-q;

	int x;

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

	{

		scanf("%d",&x);

		val[x]++;

	}

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

	{

		if(val[i] <= 0)

			puts("No");

		else puts("Yes");

	}

	return 0;

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

#define ll long long

#define ull unsinged long long

#define ld long double

#define mem(a,b) memset(a,b,sizeof(a))

#define inf (1LL<<62)

#define sf scanf

#define pf printf

#define repi(i,a,b) for(int i=a;i<=b;++i)

#define rep(i,a,b) for(ll i=a;i<=b;++i)

#define depi(i,a,b) for(int i=a;i>=b;--i)

#define dep(i,a,b) for(ll i=a;i>=b;--i)

#define mod 1000000007



using namespace std;



int ans[100005];



int main()

{

    //std::ios::sync_with_stdio(false);

    int n,k,q,s;

    mem(ans,0);

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

    int m=q-k;

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

    {

        sf("%d",&s);

        ++ans[s];

    }

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

    {

        if(ans[i]<=m)

            pf("No\n");

        else

            pf("Yes\n");

    }



    return 0;

}


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

#include<iostream>

#include<math.h> 

#include<string.h>

#include<algorithm>

using namespace std;

typedef long long ll;

ll n,k,q,b;

ll a[100000+100];

int main()

{

	cin>>n>>k>>q;

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

	{

		a[i]=k;

	}

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

	{

		cin>>b;

		a[b]++;

	}

	if(q<k)

	{

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

		printf("Yes\n");

	}

	else

	{

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

		{

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

			printf("No\n");

			else

			printf("Yes\n");

		}	

	}

	return 0;

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

#include<cstdio>

#include<algorithm>

#include <cstring>

using namespace std;

int main()

{

    int t=1,i=0,n,q,a[100005],N[100005]= {0},maxl=0,d;

    long long k;

    cin>>n>>k>>q;

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

    {

        cin>>a[i];

        N[a[i]]++;

    }

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

        if(N[i]>N[maxl])

            maxl=i;

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

        if(a[i]!=maxl)

            --k;

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

        if(N[i]+k-N[maxl]<=0)

            cout<<"No\n";

        else

            cout<<"Yes\n";

    return 0;

}




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

#include<iostream>

#include<math.h> 

#include<string.h>

#include<algorithm>

using namespace std;

typedef long long ll;

ll n,k,q,b;

ll a[100000+100];

int main()

{

	cin>>n>>k>>q;

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

	{

		a[i]=k;

	}

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

	{

		cin>>b;

		a[b]++;

	}

	if(q<k)

	{

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

		printf("Yes\n");

	}

	else

	{

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

		{

			if(a[i]-q<=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 + 10;



ll s[MAXN];



int main() {

	ios::sync_with_stdio(false);

	ll n, k, q, a;

	while(cin >> n >> k >> q) {

		memset(s, 0, sizeof(s));

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

			cin >> a;

			s[a]++;

		}

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

			if(s[i] > q - k) {

				cout << "Yes\n";

			} else {

				cout << "No\n";

			}

		}

	}

	return 0;

}

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

#include<iostream>

#include<math.h> 

#include<string.h>

#include<algorithm>

using namespace std;

typedef long long ll;

ll n,k,q,b;

ll a[100000+100];

int main()

{

	cin>>n>>k>>q;

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

	{

		a[i]=k;

	}

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

	{

		cin>>b;

		a[b]++;

	}

	if(q<k)

	{

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

		printf("Yes\n");

	}

	else

	{

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

		{

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

			printf("No\n");

			else

			printf("Yes\n");

		}	

	}

	return 0;

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

#define ll long long

#define ull unsinged long long

#define ld long double

#define mem(a,b) memset(a,b,sizeof(a))

#define inf (1LL<<62)

#define sf scanf

#define pf printf

#define repi(i,a,b) for(int i=a;i<=b;++i)

#define rep(i,a,b) for(ll i=a;i<=b;++i)

#define depi(i,a,b) for(int i=a;i>=b;--i)

#define dep(i,a,b) for(ll i=a;i>=b;--i)

#define mod 1000000007



using namespace std;



int ans[100005];



int main()

{

    //std::ios::sync_with_stdio(false);

    int n,k,q,s;

    mem(ans,0);

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

    int m=q-k;

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

    {

        sf("%d",&s);

        ++ans[s];

    }

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

    {

        if(ans[i]<=m)

            pf("No\n");

        else

            pf("Yes\n");

    }



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.3583659747804158x):
#include<iostream>

#include<cstdio>

#include<map>

#include<algorithm>

#define LL long long



using namespace std;

const int N = 1e5+7;

int a[N];

int main()

{

	ios :: sync_with_stdio(false);

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

	

	int n,k,q;

	cin>>n>>k>>q;

	int x;

	map<int,int> mp;

	

	for(int i=1;i<=n;i++) a[i]=k,a[i]-=q;

	

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

		cin>>x;

		mp[x]++;

	}

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

		a[i]+=mp[i];

		if(a[i]<=0) cout<<"No\n";

		else cout<<"Yes\n";

	}

	return 0;

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

#include<cstdio>

#include<algorithm>

#include <cstring>

using namespace std;

int main()

{

    int t=1,i=0,n,q,a[100005],N[100005]= {0},maxl=0,d;

    long long k;

    cin>>n>>k>>q;

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

    {

        cin>>a[i];

        N[a[i]]++;

    }

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

        if(N[i]>N[maxl])

            maxl=i;

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

        if(a[i]!=maxl)

            --k;

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

        if(N[i]+k-N[maxl]<=0)

            cout<<"No\n";

        else

            cout<<"Yes\n";

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.3779015493128972x):
#include<iostream>

#include<cstdio>

#include<map>

#include<algorithm>

#define LL long long



using namespace std;

const int N = 1e5+7;

int a[N];

int main()

{

	ios :: sync_with_stdio(false);

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

	

	int n,k,q;

	cin>>n>>k>>q;

	int x;

	map<int,int> mp;

	

	for(int i=1;i<=n;i++) a[i]=k,a[i]-=q;

	

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

		cin>>x;

		mp[x]++;

	}

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

		a[i]+=mp[i];

		if(a[i]<=0) cout<<"No\n";

		else cout<<"Yes\n";

	}

	return 0;

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

using namespace std;

typedef long long ll;

const int MAXN = 1e5 + 10;



ll s[MAXN];



int main() {

	ios::sync_with_stdio(false);

	ll n, k, q, a;

	while(cin >> n >> k >> q) {

		memset(s, 0, sizeof(s));

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

			cin >> a;

			s[a]++;

		}

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

			if(s[i] > q - k) {

				cout << "Yes\n";

			} else {

				cout << "No\n";

			}

		}

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.8136604057054941x):
#include<iostream>

#include<cstdio>

#include<map>

#include<algorithm>

#define LL long long



using namespace std;

const int N = 1e5+7;

int a[N];

int main()

{

	ios :: sync_with_stdio(false);

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

	

	int n,k,q;

	cin>>n>>k>>q;

	int x;

	map<int,int> mp;

	

	for(int i=1;i<=n;i++) a[i]=k,a[i]-=q;

	

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

		cin>>x;

		mp[x]++;

	}

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

		a[i]+=mp[i];

		if(a[i]<=0) cout<<"No\n";

		else cout<<"Yes\n";

	}

	return 0;

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

#define ll long long

#define ull unsinged long long

#define ld long double

#define mem(a,b) memset(a,b,sizeof(a))

#define inf (1LL<<62)

#define sf scanf

#define pf printf

#define repi(i,a,b) for(int i=a;i<=b;++i)

#define rep(i,a,b) for(ll i=a;i<=b;++i)

#define depi(i,a,b) for(int i=a;i>=b;--i)

#define dep(i,a,b) for(ll i=a;i>=b;--i)

#define mod 1000000007



using namespace std;



int ans[100005];



int main()

{

    //std::ios::sync_with_stdio(false);

    int n,k,q,s;

    mem(ans,0);

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

    int m=q-k;

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

    {

        sf("%d",&s);

        ++ans[s];

    }

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

    {

        if(ans[i]<=m)

            pf("No\n");

        else

            pf("Yes\n");

    }



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.3942920425736263x):
/// However long the night,

///     The dawn will break

/// ICPC next year



#include<bits/stdc++.h>

using namespace std ;

const int N = 1e5+5 ;



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

int main(){

    cin >> n >> k >> q ;

    fill(cnt,cnt+n,k-q);

    while(q--){

        scanf("%d",&x);

        ++cnt[x-1];

    }

    for(int i=0;i<n;++i) puts(cnt[i]<=0?"No":"Yes");

    return 0;

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

#include<cstdio>

#include<algorithm>

#include <cstring>

using namespace std;

int main()

{

    int t=1,i=0,n,q,a[100005],N[100005]= {0},maxl=0,d;

    long long k;

    cin>>n>>k>>q;

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

    {

        cin>>a[i];

        N[a[i]]++;

    }

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

        if(N[i]>N[maxl])

            maxl=i;

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

        if(a[i]!=maxl)

            --k;

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

        if(N[i]+k-N[maxl]<=0)

            cout<<"No\n";

        else

            cout<<"Yes\n";

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.4143442940459483x):
/// However long the night,

///     The dawn will break

/// ICPC next year



#include<bits/stdc++.h>

using namespace std ;

const int N = 1e5+5 ;



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

int main(){

    cin >> n >> k >> q ;

    fill(cnt,cnt+n,k-q);

    while(q--){

        scanf("%d",&x);

        ++cnt[x-1];

    }

    for(int i=0;i<n;++i) puts(cnt[i]<=0?"No":"Yes");

    return 0;

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

using namespace std;

typedef long long ll;

const int MAXN = 1e5 + 10;



ll s[MAXN];



int main() {

	ios::sync_with_stdio(false);

	ll n, k, q, a;

	while(cin >> n >> k >> q) {

		memset(s, 0, sizeof(s));

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

			cin >> a;

			s[a]++;

		}

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

			if(s[i] > q - k) {

				cout << "Yes\n";

			} else {

				cout << "No\n";

			}

		}

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.8616281021135042x):
/// However long the night,

///     The dawn will break

/// ICPC next year



#include<bits/stdc++.h>

using namespace std ;

const int N = 1e5+5 ;



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

int main(){

    cin >> n >> k >> q ;

    fill(cnt,cnt+n,k-q);

    while(q--){

        scanf("%d",&x);

        ++cnt[x-1];

    }

    for(int i=0;i<n;++i) puts(cnt[i]<=0?"No":"Yes");

    return 0;

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

#define ll long long

#define ull unsinged long long

#define ld long double

#define mem(a,b) memset(a,b,sizeof(a))

#define inf (1LL<<62)

#define sf scanf

#define pf printf

#define repi(i,a,b) for(int i=a;i<=b;++i)

#define rep(i,a,b) for(ll i=a;i<=b;++i)

#define depi(i,a,b) for(int i=a;i>=b;--i)

#define dep(i,a,b) for(ll i=a;i>=b;--i)

#define mod 1000000007



using namespace std;



int ans[100005];



int main()

{

    //std::ios::sync_with_stdio(false);

    int n,k,q,s;

    mem(ans,0);

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

    int m=q-k;

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

    {

        sf("%d",&s);

        ++ans[s];

    }

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

    {

        if(ans[i]<=m)

            pf("No\n");

        else

            pf("Yes\n");

    }



    return 0;

}


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

typedef long long ll;

using namespace std;

ll ar[100009];

int main()

{

   ll i,j,n,k,q,mn=0,r;

   cin>>n>>k>>q;

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

   {

     ar[i]=k;

   }

   



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

   {

     cin>>r;

     mn++;

     ar[r]+=1;

   }   

    

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

    {

     

       ar[i]-=mn;

    }



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

   {

     if(ar[i]>0)

     {

       cout<<"Yes"<<endl;

     }



     else cout<<"No"<<endl;

   }

   return 0;

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

#include<cstdio>

#include<algorithm>

#include <cstring>

using namespace std;

int main()

{

    int t=1,i=0,n,q,a[100005],N[100005]= {0},maxl=0,d;

    long long k;

    cin>>n>>k>>q;

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

    {

        cin>>a[i];

        N[a[i]]++;

    }

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

        if(N[i]>N[maxl])

            maxl=i;

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

        if(a[i]!=maxl)

            --k;

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

        if(N[i]+k-N[maxl]<=0)

            cout<<"No\n";

        else

            cout<<"Yes\n";

    return 0;

}




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

typedef long long ll;

using namespace std;

ll ar[100009];

int main()

{

   ll i,j,n,k,q,mn=0,r;

   cin>>n>>k>>q;

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

   {

     ar[i]=k;

   }

   



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

   {

     cin>>r;

     mn++;

     ar[r]+=1;

   }   

    

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

    {

     

       ar[i]-=mn;

    }



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

   {

     if(ar[i]>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 + 10;



ll s[MAXN];



int main() {

	ios::sync_with_stdio(false);

	ll n, k, q, a;

	while(cin >> n >> k >> q) {

		memset(s, 0, sizeof(s));

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

			cin >> a;

			s[a]++;

		}

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

			if(s[i] > q - k) {

				cout << "Yes\n";

			} else {

				cout << "No\n";

			}

		}

	}

	return 0;

}

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

typedef long long ll;

using namespace std;

ll ar[100009];

int main()

{

   ll i,j,n,k,q,mn=0,r;

   cin>>n>>k>>q;

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

   {

     ar[i]=k;

   }

   



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

   {

     cin>>r;

     mn++;

     ar[r]+=1;

   }   

    

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

    {

     

       ar[i]-=mn;

    }



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

   {

     if(ar[i]>0)

     {

       cout<<"Yes"<<endl;

     }



     else cout<<"No"<<endl;

   }

   return 0;

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

#define ll long long

#define ull unsinged long long

#define ld long double

#define mem(a,b) memset(a,b,sizeof(a))

#define inf (1LL<<62)

#define sf scanf

#define pf printf

#define repi(i,a,b) for(int i=a;i<=b;++i)

#define rep(i,a,b) for(ll i=a;i<=b;++i)

#define depi(i,a,b) for(int i=a;i>=b;--i)

#define dep(i,a,b) for(ll i=a;i>=b;--i)

#define mod 1000000007



using namespace std;



int ans[100005];



int main()

{

    //std::ios::sync_with_stdio(false);

    int n,k,q,s;

    mem(ans,0);

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

    int m=q-k;

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

    {

        sf("%d",&s);

        ++ans[s];

    }

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

    {

        if(ans[i]<=m)

            pf("No\n");

        else

            pf("Yes\n");

    }



    return 0;

}


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



using namespace std;



const int N = 410;



int main() {

  int n; cin >> n;

  int k; cin >> k;

  int q; cin >> q;

  vector <int> player(n + 1, 0);

  int loss = 0;

  while(q--) {

    int a; cin >> a;

    loss++; player[a]++;

  }

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

    int total = (k - loss + player[i]);

    if(total > 0) {

      puts("Yes");

    }

    else {

      puts("No");

    }

  }

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

#include<cstdio>

#include<algorithm>

#include <cstring>

using namespace std;

int main()

{

    int t=1,i=0,n,q,a[100005],N[100005]= {0},maxl=0,d;

    long long k;

    cin>>n>>k>>q;

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

    {

        cin>>a[i];

        N[a[i]]++;

    }

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

        if(N[i]>N[maxl])

            maxl=i;

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

        if(a[i]!=maxl)

            --k;

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

        if(N[i]+k-N[maxl]<=0)

            cout<<"No\n";

        else

            cout<<"Yes\n";

    return 0;

}




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



using namespace std;



const int N = 410;



int main() {

  int n; cin >> n;

  int k; cin >> k;

  int q; cin >> q;

  vector <int> player(n + 1, 0);

  int loss = 0;

  while(q--) {

    int a; cin >> a;

    loss++; player[a]++;

  }

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

    int total = (k - loss + player[i]);

    if(total > 0) {

      puts("Yes");

    }

    else {

      puts("No");

    }

  }

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

using namespace std;

typedef long long ll;

const int MAXN = 1e5 + 10;



ll s[MAXN];



int main() {

	ios::sync_with_stdio(false);

	ll n, k, q, a;

	while(cin >> n >> k >> q) {

		memset(s, 0, sizeof(s));

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

			cin >> a;

			s[a]++;

		}

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

			if(s[i] > q - k) {

				cout << "Yes\n";

			} else {

				cout << "No\n";

			}

		}

	}

	return 0;

}

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



using namespace std;



const int N = 410;



int main() {

  int n; cin >> n;

  int k; cin >> k;

  int q; cin >> q;

  vector <int> player(n + 1, 0);

  int loss = 0;

  while(q--) {

    int a; cin >> a;

    loss++; player[a]++;

  }

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

    int total = (k - loss + player[i]);

    if(total > 0) {

      puts("Yes");

    }

    else {

      puts("No");

    }

  }

}