//codeforces 2051C
#include <iostream>
#include <vector>
void solve(){
int n,m,k;std::cin>>n>>m>>k;
if(k==n){
for(int i = 0;i<m;++i){
std::cout<<'1';
}
int temp;
for(int i = 0;i<m+k;++i)std::cin>>temp;
}else if(k<n-1){
for(int i = 0;i<m;++i){
std::cout<<'0';
}
int temp;
for(int i = 0;i<m+k;++i)std::cin>>temp;
}else{
//k==n-1
std::vector<int> a(m);
for(int i = 0;i<m;++i)std::cin>>a[i];
int shortage=0;
for(int i = 1;i<=k;++i){
int temp;std::cin>>temp;
if(temp!=i){
shortage = temp-1;
for(int j = i+1;j<=k;++j)std::cin>>temp;
break;
}
}
if(shortage==0)shortage = n;
for(int i = 1;i<shortage && i<=m;++i)std::cout<<'0';
if(shortage<=m)std::cout<<'1';
for(int i = shortage+1;i<=m;++i)std::cout<<'0';
}
std::cout<<std::endl;
}
int main(){
int t;std::cin>>t;
while(t--){
solve();
}
}