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

#include<cstring>

#include<iostream>

#include<algorithm>

#include<stdlib.h>

#include<string.h>

#include<cmath>

using namespace std;

typedef long long ll;

#define N 100005

int main()

{

    int n,m,i,j,k,l;

    int T,unit;

    int x,z,y,x1,y1;

    int ans1=0,ans2=0;

    int n1,n2;

    int a[100005]={0};

    scanf("%d%d%d",&n,&m,&T);

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

    {

        scanf("%d",&x);

        a[x]++;

    }

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

    {

        if(m<=T-a[i])

            printf("No\n");

        else

            printf("Yes\n");

    }

    return 0;

}


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

using namespace std;

int main()

{



    int k,l,c=0,x,s=0,t,m,n;

    cin>>m>>n>>k;

    int a[k+10];

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

    map<int,int>s1;



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

    {

        cin>>x;

        s1[x-1]++;

    }

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

    {

        t = s1[i]+n-k;



        if(t <= 0)

        {

            cout<<"No\n";

        }

        else{

            cout<<"Yes\n";

        }

    }



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

#include<iostream>

#include<algorithm>

#include<cstring>

#include<string>

using namespace std;

typedef long long ll;

const int maxn=1e5+100;

int main()

{

	ll n,k,q;

	ll x;

	ll a[maxn];

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

	scanf("%lld%lld%lld",&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");

		else

			printf("No");

		if(i!=n)

			printf("\n");

//		printf("%d ",a[i]+k-q);

	}

	return 0;

}

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

using namespace std;

int main()

{



    int k,l,c=0,x,s=0,t,m,n;

    cin>>m>>n>>k;

    int a[k+10];

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

    map<int,int>s1;



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

    {

        cin>>x;

        s1[x-1]++;

    }

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

    {

        t = s1[i]+n-k;



        if(t <= 0)

        {

            cout<<"No\n";

        }

        else{

            cout<<"Yes\n";

        }

    }



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

using namespace std;

typedef long long ll;

const int maxn=2e5+6;

int main()

{

	int n,k,q,a,vis[maxn],flag[maxn];

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

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

	memset(flag,0,sizeof(flag));

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

	{

		scanf("%d",&a);

		vis[a]++;

	}

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

	{

		if(q-vis[j]<k)

		{

			flag[j]=1;

		}

		else

		{

			flag[j]=0;

		}

	}

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

	{

		if(flag[i]==1)

		{

			printf("Yes\n");

		}

		else

		{

			printf("No\n");

		}

	}

	return 0;

}

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

using namespace std;

int main()

{



    int k,l,c=0,x,s=0,t,m,n;

    cin>>m>>n>>k;

    int a[k+10];

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

    map<int,int>s1;



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

    {

        cin>>x;

        s1[x-1]++;

    }

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

    {

        t = s1[i]+n-k;



        if(t <= 0)

        {

            cout<<"No\n";

        }

        else{

            cout<<"Yes\n";

        }

    }



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

#include<cstring>

#include<iostream>

#include<algorithm>

#include<stdlib.h>

#include<string.h>

#include<cmath>

using namespace std;

typedef long long ll;

#define N 100005

int main()

{

    int n,m,i,j,k,l;

    int T,unit;

    int x,z,y,x1,y1;

    int ans1=0,ans2=0;

    int n1,n2;

    int a[100005]={0};

    scanf("%d%d%d",&n,&m,&T);

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

    {

        scanf("%d",&x);

        a[x]++;

    }

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

    {

        if(m<=T-a[i])

            printf("No\n");

        else

            printf("Yes\n");

    }

    return 0;

}


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

using namespace std;

int main()

{

    int a,b,c,d,e,f,g,h,i,j;

    cin>>a;

    bool ar[a];



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

    {

        ar[i]=false;



    }

    cin>>b>>c;

    h=c;

    map<int,int>m;

    map<int,int>::iterator it;

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

    {

        m[i]=0;

    }

    while(c--)

    {

        int x;



        cin>>x;

        m[x]++;

    }

    vector<int>v;



    for(it=m.begin(); it!=m.end(); it++)

    {

        int k=(*it).second;

        if((b+k)-h>0)

        {

            ar[(*it).first]=true;

        }

    }



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

    {

        if(ar[i]==true)

        {

            cout<<"Yes"<<endl;

        }

        else

        {

            cout<<"No"<<endl;

        }

    }

    m.clear();

    return 0;







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

#include<iostream>

#include<algorithm>

#include<cstring>

#include<string>

using namespace std;

typedef long long ll;

const int maxn=1e5+100;

int main()

{

	ll n,k,q;

	ll x;

	ll a[maxn];

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

	scanf("%lld%lld%lld",&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");

		else

			printf("No");

		if(i!=n)

			printf("\n");

//		printf("%d ",a[i]+k-q);

	}

	return 0;

}

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

using namespace std;

int main()

{

    int a,b,c,d,e,f,g,h,i,j;

    cin>>a;

    bool ar[a];



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

    {

        ar[i]=false;



    }

    cin>>b>>c;

    h=c;

    map<int,int>m;

    map<int,int>::iterator it;

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

    {

        m[i]=0;

    }

    while(c--)

    {

        int x;



        cin>>x;

        m[x]++;

    }

    vector<int>v;



    for(it=m.begin(); it!=m.end(); it++)

    {

        int k=(*it).second;

        if((b+k)-h>0)

        {

            ar[(*it).first]=true;

        }

    }



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

    {

        if(ar[i]==true)

        {

            cout<<"Yes"<<endl;

        }

        else

        {

            cout<<"No"<<endl;

        }

    }

    m.clear();

    return 0;







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

using namespace std;

typedef long long ll;

const int maxn=2e5+6;

int main()

{

	int n,k,q,a,vis[maxn],flag[maxn];

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

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

	memset(flag,0,sizeof(flag));

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

	{

		scanf("%d",&a);

		vis[a]++;

	}

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

	{

		if(q-vis[j]<k)

		{

			flag[j]=1;

		}

		else

		{

			flag[j]=0;

		}

	}

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

	{

		if(flag[i]==1)

		{

			printf("Yes\n");

		}

		else

		{

			printf("No\n");

		}

	}

	return 0;

}

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

using namespace std;

int main()

{

    int a,b,c,d,e,f,g,h,i,j;

    cin>>a;

    bool ar[a];



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

    {

        ar[i]=false;



    }

    cin>>b>>c;

    h=c;

    map<int,int>m;

    map<int,int>::iterator it;

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

    {

        m[i]=0;

    }

    while(c--)

    {

        int x;



        cin>>x;

        m[x]++;

    }

    vector<int>v;



    for(it=m.begin(); it!=m.end(); it++)

    {

        int k=(*it).second;

        if((b+k)-h>0)

        {

            ar[(*it).first]=true;

        }

    }



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

    {

        if(ar[i]==true)

        {

            cout<<"Yes"<<endl;

        }

        else

        {

            cout<<"No"<<endl;

        }

    }

    m.clear();

    return 0;







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

#include<cstring>

#include<iostream>

#include<algorithm>

#include<stdlib.h>

#include<string.h>

#include<cmath>

using namespace std;

typedef long long ll;

#define N 100005

int main()

{

    int n,m,i,j,k,l;

    int T,unit;

    int x,z,y,x1,y1;

    int ans1=0,ans2=0;

    int n1,n2;

    int a[100005]={0};

    scanf("%d%d%d",&n,&m,&T);

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

    {

        scanf("%d",&x);

        a[x]++;

    }

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

    {

        if(m<=T-a[i])

            printf("No\n");

        else

            printf("Yes\n");

    }

    return 0;

}


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

#include<cstdio>

#include<cstring>

#include<string>

#include<vector>

#include<queue>

#include<cmath>

#include<algorithm>

#include<iomanip>

#include<functional>

#include<set>

#include<map>

#include<climits>

#include<numeric>

#include<utility>

#define ul unsigned long long int

#define ll long long int

#define MAX 1000000+1

using namespace std;

#define F first

#define S second

#define pi 2*acos(0.0)

#define PB push_back

#define CL clear()







int main()

{

   int n, k, q;

   int c;

   cin >> n >> k>> q;

   c = q;

   int arr[n+1];

   for(int i = 0; i <= n; i++) arr[i] = 0;

   int a;

   while(q--)

   {

       cin >> a;



       arr[a]++;

   }

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

   {

       if(k-c+arr[i]>0) cout <<"Yes\n";

       else cout <<"No\n";

   }



return 0;

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

#include<iostream>

#include<algorithm>

#include<cstring>

#include<string>

using namespace std;

typedef long long ll;

const int maxn=1e5+100;

int main()

{

	ll n,k,q;

	ll x;

	ll a[maxn];

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

	scanf("%lld%lld%lld",&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");

		else

			printf("No");

		if(i!=n)

			printf("\n");

//		printf("%d ",a[i]+k-q);

	}

	return 0;

}

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

#include<cstdio>

#include<cstring>

#include<string>

#include<vector>

#include<queue>

#include<cmath>

#include<algorithm>

#include<iomanip>

#include<functional>

#include<set>

#include<map>

#include<climits>

#include<numeric>

#include<utility>

#define ul unsigned long long int

#define ll long long int

#define MAX 1000000+1

using namespace std;

#define F first

#define S second

#define pi 2*acos(0.0)

#define PB push_back

#define CL clear()







int main()

{

   int n, k, q;

   int c;

   cin >> n >> k>> q;

   c = q;

   int arr[n+1];

   for(int i = 0; i <= n; i++) arr[i] = 0;

   int a;

   while(q--)

   {

       cin >> a;



       arr[a]++;

   }

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

   {

       if(k-c+arr[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=2e5+6;

int main()

{

	int n,k,q,a,vis[maxn],flag[maxn];

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

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

	memset(flag,0,sizeof(flag));

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

	{

		scanf("%d",&a);

		vis[a]++;

	}

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

	{

		if(q-vis[j]<k)

		{

			flag[j]=1;

		}

		else

		{

			flag[j]=0;

		}

	}

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

	{

		if(flag[i]==1)

		{

			printf("Yes\n");

		}

		else

		{

			printf("No\n");

		}

	}

	return 0;

}

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

#include<cstdio>

#include<cstring>

#include<string>

#include<vector>

#include<queue>

#include<cmath>

#include<algorithm>

#include<iomanip>

#include<functional>

#include<set>

#include<map>

#include<climits>

#include<numeric>

#include<utility>

#define ul unsigned long long int

#define ll long long int

#define MAX 1000000+1

using namespace std;

#define F first

#define S second

#define pi 2*acos(0.0)

#define PB push_back

#define CL clear()







int main()

{

   int n, k, q;

   int c;

   cin >> n >> k>> q;

   c = q;

   int arr[n+1];

   for(int i = 0; i <= n; i++) arr[i] = 0;

   int a;

   while(q--)

   {

       cin >> a;



       arr[a]++;

   }

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

   {

       if(k-c+arr[i]>0) cout <<"Yes\n";

       else cout <<"No\n";

   }



return 0;

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

#include<cstring>

#include<iostream>

#include<algorithm>

#include<stdlib.h>

#include<string.h>

#include<cmath>

using namespace std;

typedef long long ll;

#define N 100005

int main()

{

    int n,m,i,j,k,l;

    int T,unit;

    int x,z,y,x1,y1;

    int ans1=0,ans2=0;

    int n1,n2;

    int a[100005]={0};

    scanf("%d%d%d",&n,&m,&T);

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

    {

        scanf("%d",&x);

        a[x]++;

    }

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

    {

        if(m<=T-a[i])

            printf("No\n");

        else

            printf("Yes\n");

    }

    return 0;

}


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

#include<math.h>

using namespace std;

int main()

{

    long long int n,k,q,b,i,j,sum=0,player;

    cin>>n>>k>>q;

    map<int,int>m;

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

    {

        cin>>b;

        m[b]++;

    }

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

    {

        if(k-(q-m[i])>0)

            cout<<"Yes"<<endl;

        else

            cout<<"No"<<endl;

    }

    return 0;

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

#include<iostream>

#include<algorithm>

#include<cstring>

#include<string>

using namespace std;

typedef long long ll;

const int maxn=1e5+100;

int main()

{

	ll n,k,q;

	ll x;

	ll a[maxn];

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

	scanf("%lld%lld%lld",&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");

		else

			printf("No");

		if(i!=n)

			printf("\n");

//		printf("%d ",a[i]+k-q);

	}

	return 0;

}

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

#include<math.h>

using namespace std;

int main()

{

    long long int n,k,q,b,i,j,sum=0,player;

    cin>>n>>k>>q;

    map<int,int>m;

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

    {

        cin>>b;

        m[b]++;

    }

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

    {

        if(k-(q-m[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=2e5+6;

int main()

{

	int n,k,q,a,vis[maxn],flag[maxn];

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

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

	memset(flag,0,sizeof(flag));

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

	{

		scanf("%d",&a);

		vis[a]++;

	}

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

	{

		if(q-vis[j]<k)

		{

			flag[j]=1;

		}

		else

		{

			flag[j]=0;

		}

	}

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

	{

		if(flag[i]==1)

		{

			printf("Yes\n");

		}

		else

		{

			printf("No\n");

		}

	}

	return 0;

}

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

#include<math.h>

using namespace std;

int main()

{

    long long int n,k,q,b,i,j,sum=0,player;

    cin>>n>>k>>q;

    map<int,int>m;

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

    {

        cin>>b;

        m[b]++;

    }

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

    {

        if(k-(q-m[i])>0)

            cout<<"Yes"<<endl;

        else

            cout<<"No"<<endl;

    }

    return 0;

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

#include<cstring>

#include<iostream>

#include<algorithm>

#include<stdlib.h>

#include<string.h>

#include<cmath>

using namespace std;

typedef long long ll;

#define N 100005

int main()

{

    int n,m,i,j,k,l;

    int T,unit;

    int x,z,y,x1,y1;

    int ans1=0,ans2=0;

    int n1,n2;

    int a[100005]={0};

    scanf("%d%d%d",&n,&m,&T);

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

    {

        scanf("%d",&x);

        a[x]++;

    }

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

    {

        if(m<=T-a[i])

            printf("No\n");

        else

            printf("Yes\n");

    }

    return 0;

}


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

#include <algorithm>

#define debug freopen("1.in","r",stdin),freopen("1.out","w",stdout);

#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;

typedef long long ll;

const ll maxn = 1e5 + 10;



int n, k, q, score[maxn], test;

int main(){

    ios;

    cin >> n >> k >> q;

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

        score[i] = k;

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

        cin >> test;

        score[test] ++;

    }

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

        if (score[i] > q)

            cout << "Yes" << endl;

        else

            cout << "No" << endl;



    return 0;

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

#include<iostream>

#include<algorithm>

#include<cstring>

#include<string>

using namespace std;

typedef long long ll;

const int maxn=1e5+100;

int main()

{

	ll n,k,q;

	ll x;

	ll a[maxn];

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

	scanf("%lld%lld%lld",&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");

		else

			printf("No");

		if(i!=n)

			printf("\n");

//		printf("%d ",a[i]+k-q);

	}

	return 0;

}

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

#include <algorithm>

#define debug freopen("1.in","r",stdin),freopen("1.out","w",stdout);

#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;

typedef long long ll;

const ll maxn = 1e5 + 10;



int n, k, q, score[maxn], test;

int main(){

    ios;

    cin >> n >> k >> q;

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

        score[i] = k;

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

        cin >> test;

        score[test] ++;

    }

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

        if (score[i] > q)

            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=2e5+6;

int main()

{

	int n,k,q,a,vis[maxn],flag[maxn];

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

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

	memset(flag,0,sizeof(flag));

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

	{

		scanf("%d",&a);

		vis[a]++;

	}

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

	{

		if(q-vis[j]<k)

		{

			flag[j]=1;

		}

		else

		{

			flag[j]=0;

		}

	}

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

	{

		if(flag[i]==1)

		{

			printf("Yes\n");

		}

		else

		{

			printf("No\n");

		}

	}

	return 0;

}

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

#include <algorithm>

#define debug freopen("1.in","r",stdin),freopen("1.out","w",stdout);

#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;

typedef long long ll;

const ll maxn = 1e5 + 10;



int n, k, q, score[maxn], test;

int main(){

    ios;

    cin >> n >> k >> q;

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

        score[i] = k;

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

        cin >> test;

        score[test] ++;

    }

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

        if (score[i] > q)

            cout << "Yes" << endl;

        else

            cout << "No" << endl;



    return 0;

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

#include<cstring>

#include<iostream>

#include<algorithm>

#include<stdlib.h>

#include<string.h>

#include<cmath>

using namespace std;

typedef long long ll;

#define N 100005

int main()

{

    int n,m,i,j,k,l;

    int T,unit;

    int x,z,y,x1,y1;

    int ans1=0,ans2=0;

    int n1,n2;

    int a[100005]={0};

    scanf("%d%d%d",&n,&m,&T);

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

    {

        scanf("%d",&x);

        a[x]++;

    }

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

    {

        if(m<=T-a[i])

            printf("No\n");

        else

            printf("Yes\n");

    }

    return 0;

}


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

#include <fstream>

#include <cstdio>

#include <vector>

#include <map>

#include <unordered_map>

#include <set>

#include <unordered_set>

#include <stack>

#include <queue>

#include <algorithm>

#include <string.h>

#include <string>

#include <math.h>

#include <iomanip>

using namespace std;



#define SORT(v) sort((v).begin(), (v).end())

#define RSORT(v) sort((v).rbegin(), (v).rend())

#define pb push_back



typedef pair<int, int> pii;

typedef long long ll;

typedef unsigned long long ull;



const int mod = (int)1e9 + 7;

const int mod2 = 998244353;



ll exp(ll taban, ll us, ll md) {

    ll carpan = taban % md;

	if(carpan == 0) return 0;

    ll temp = us;

    ll res = 1;

    while(temp){

        if(temp % 2) res = (res*carpan) % md;

        temp /= 2;

        carpan = (carpan*carpan) % md;

    }

    return res;

}

 

ll ebob(ll a, ll b){

    if(!a)return b;

    return ebob(b%a, a);

}



ll ekok(ll a, ll b){

    return (a*b)/ebob(a, b);

}



ll mul(ll a, ll b, ll md){

	return a*b % md;

}



vector<ll> fact;

vector<ll> inv_fact;

void fact_init(int n){

	fact.resize(n+5);

	inv_fact.resize(n+5);

	fact[0] = inv_fact[0] = 1;

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

		fact[i] = (fact[i-1] * i) % mod;

		inv_fact[i] = exp(fact[i], mod-2, mod);

	}

}



ll komb(ll a, ll b){

	if(a < b) return 0;

	return fact[a] * (inv_fact[a-b] * inv_fact[b] % mod) % mod;

}



const int N = 1e5+5;

int ans;



int main(){

	ios::sync_with_stdio(false); cin.tie(NULL);

	int n, k, q; cin>>n>>k>>q;

	int cnt[n+1] = {};

	int top = q;

	while(q--){

		int s; cin>>s; cnt[s]++;

	}

	for(int i = 1; i <= n; i++) cnt[i] = k - top + cnt[i];

	for(int i = 1; i <= n; i++) cnt[i] > 0 ? cout<<"Yes\n" : cout<<"No\n";

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

#include<iostream>

#include<algorithm>

#include<cstring>

#include<string>

using namespace std;

typedef long long ll;

const int maxn=1e5+100;

int main()

{

	ll n,k,q;

	ll x;

	ll a[maxn];

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

	scanf("%lld%lld%lld",&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");

		else

			printf("No");

		if(i!=n)

			printf("\n");

//		printf("%d ",a[i]+k-q);

	}

	return 0;

}

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

#include <fstream>

#include <cstdio>

#include <vector>

#include <map>

#include <unordered_map>

#include <set>

#include <unordered_set>

#include <stack>

#include <queue>

#include <algorithm>

#include <string.h>

#include <string>

#include <math.h>

#include <iomanip>

using namespace std;



#define SORT(v) sort((v).begin(), (v).end())

#define RSORT(v) sort((v).rbegin(), (v).rend())

#define pb push_back



typedef pair<int, int> pii;

typedef long long ll;

typedef unsigned long long ull;



const int mod = (int)1e9 + 7;

const int mod2 = 998244353;



ll exp(ll taban, ll us, ll md) {

    ll carpan = taban % md;

	if(carpan == 0) return 0;

    ll temp = us;

    ll res = 1;

    while(temp){

        if(temp % 2) res = (res*carpan) % md;

        temp /= 2;

        carpan = (carpan*carpan) % md;

    }

    return res;

}

 

ll ebob(ll a, ll b){

    if(!a)return b;

    return ebob(b%a, a);

}



ll ekok(ll a, ll b){

    return (a*b)/ebob(a, b);

}



ll mul(ll a, ll b, ll md){

	return a*b % md;

}



vector<ll> fact;

vector<ll> inv_fact;

void fact_init(int n){

	fact.resize(n+5);

	inv_fact.resize(n+5);

	fact[0] = inv_fact[0] = 1;

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

		fact[i] = (fact[i-1] * i) % mod;

		inv_fact[i] = exp(fact[i], mod-2, mod);

	}

}



ll komb(ll a, ll b){

	if(a < b) return 0;

	return fact[a] * (inv_fact[a-b] * inv_fact[b] % mod) % mod;

}



const int N = 1e5+5;

int ans;



int main(){

	ios::sync_with_stdio(false); cin.tie(NULL);

	int n, k, q; cin>>n>>k>>q;

	int cnt[n+1] = {};

	int top = q;

	while(q--){

		int s; cin>>s; cnt[s]++;

	}

	for(int i = 1; i <= n; i++) cnt[i] = k - top + cnt[i];

	for(int i = 1; i <= n; i++) cnt[i] > 0 ? cout<<"Yes\n" : cout<<"No\n";

}