#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <unordered_map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N, M;
  cin >> N >> M;
  vector<ll> A(N);
  vector<ll> B(M);
  unordered_map<ll, int> mp;

  for (int i = 0; i < N; ++i) {
    cin >> A[i];
    mp[A[i]]++;
  }

  for (int i = 0; i < M; ++i) {
    cin >> B[i];
  }

  for (int i = 0; i < M; ++i) {
    cout << mp[B[i]];
    if (i != M - 1) cout << " ";
  }
  cout << endl;

  return 0;
}