#include <iostream> 
#include <string> 
#include <vector> 
#include <cmath> 
#include <algorithm> 
#include <cstdlib> 
#include <ctime> 
#include <cstdio> 
#include <functional> 
#include <set> 
#include <sstream> 
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
#include <unordered_map>
 
using namespace std; 

const long long INF=1LL<<50LL;
const double PI=3.14159265358979323846264;

hash<long long> h_ll;

class myHash {
public:
	size_t operator()(const int &x) const {
		const long long mod=1e9+7;
		return h_ll(x)^h_ll((x+1145141919)%mod);
	}
};

int main(){

	int n,m;
	cin>>n>>m;
	
	vector<long long> a(n);
	for(int i=0;i<n;i++){
		scanf("%lld",&a[i]);
	}
	sort(a.begin(),a.end());
	
	long long b;
	for(int i=0;i<m;i++){	
		scanf("%lld",&b);
		cout<<upper_bound(a.begin(),a.end(),b)-lower_bound(a.begin(),a.end(),b)<<" ";
	}
	cout<<endl;

	
	return 0;
}