#include<iostream>
#include<map>

using namespace std;

#define NMAX 1000

int main(){

	int N,M;
	long long A,B;
	map<long long,int> c;

	cin>>N>>M;

	for(int i=0;i<N;i++){
		cin>>A;
		if(c.empty()||c.find(A)==c.end()) c.insert(pair<long long, int>(A,1));
		else c[A]++;
	}

	for(int i=0;i<M;i++){
		cin>>B;
		if(c.find(B)==c.end()) cout<<"0";
		else cout<<c[B];
		cout<<(i==M-1?"\n":" ");
	}


}