bool M1;
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<climits>
#include<iomanip>
#include<cassert>
#include<random>
#include<cstdio>
#include<vector>
#include<bitset>
#include<stack>
#include<queue>
#include<deque>
#include<cmath>
#include<ctime>
#include<map>
#include<set>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/hash_policy.hpp>
//#include<ext/pb_ds/priority_queue.hpp>
#define fi first
#define se second
#define LD double
#define ll long long
#define Vector Point
#define I128 __int128
#define ull unsigned ll
#define pii pair<int,int>
#define pb(x) push_back(x)
#define syt cerr<<"sytakioi\n"
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define rd_i(l,r) uniform_int_distribution<int>(l,r)(rd)
#define rd_r(l,r) uniform_real_distribution<double>(l,r)(rd)
#define look_time cerr<<(clock()-Time)*1.0/CLOCKS_PER_SEC<<'\n'
using namespace std;
//using namespace __gnu_cxx;
mt19937 rd(time(0));
const int N=3e5+5;
int n,m,k;
int a[N],b[N];
int f[N],g[N];
set<int> s[N];
/*
g[i+1]-1 f[i-1]+1之间有a[i] 
*/
bool M2;
int main(){
	int Time=clock();
	look_memory;
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>m>>k;
	F(i,1,n) cin>>a[i];
	F(i,1,m) cin>>b[i],s[b[i]].emplace(i);
	int l=1;
	F(i,1,n){
		if(a[i]==b[l]) ++l;
		f[i]=l-1;
	}
	g[n+1]=m+1;
	l=m;
	UF(i,n,1){
		if(a[i]==b[l]) --l;
		g[i]=l+1;
	}
	F(i,1,n){
		int l=g[i+1]-1,r=f[i-1]+1;
//		cout<<l<<' '<<r<<'\n';
		auto it=s[a[i]].lower_bound(l);
		if(it!=s[a[i]].end()&&*it<=r) cout<<"1 ";
		else cout<<"0 ";
	}
	cout<<'\n';
	look_time;
	return 0;
}