#include <iostream>
#include <algorithm>
using namespace std;
using i64 = long long;

const int N = 10010;
int n, m;
vector<i64> a, b;

int main(void) {
  scanf("%d%d", &n, &m);
  a.assign(n, 0);
  b.assign(m, 0);
  for(int i=0; i<n; ++i) { scanf("%lld", &a[i]); }
  for(int i=0; i<m; ++i) { scanf("%lld", &b[i]); }
  sort(a.begin(), a.end());
  for(int i=0; i<m; ++i) {
    if(i) { putchar(' '); }
    printf("%ld", upper_bound(a.begin(), a.end(), b[i]) - lower_bound(a.begin(), a.end(), b[i]));
  }
  putchar('\n');
  return 0;
}