眼红的Medusa

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int a[N],b[N],n,m;
priority_queue< int > q;
int myFind(int l,int r,int x){\
	if(l>r) 	     return 0;
	int mid=(l+r)/2;
	if(b[mid]>x)	 r=mid-1;
	else if(b[mid]<x)l=mid+1;
	else             return 1;
	return myFind(l,r,x); 
}
int main(){
	int x,i;
	cin>>n>>m;
	for(int i=0;i<n;i++){
		cin>>a[i];
	}for(int i=0;i<m;i++){
		cin>>x;
		q.push(-x);
	}i=0;
	while(!q.empty()){
		b[i]= -q.top();
		q.pop();
		i++;
	}for(i=0;i<=n;i++){
		if(myFind(0,m-1,a[i])){
			cout<<a[i]<<" ";
		}
	}
	
	return 0;
}