#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int main() {
    int n, m;
    while (cin >> n >> m) {
        vector<int> h(n), q(m), v;
        for (int i = 0; i < n; i++) {
            scanf("%d", &h[i]);
            v.push_back(h[i]);
        }
        for (int j = 0; j < m; j++) {
            scanf("%d", &q[j]);
            v.push_back(q[j]);
        }
        sort(v.begin(), v.end());
        v.erase(unique(v.begin(), v.end()), v.end());
        int l = v.size();
        vector<int> a(l);
        for (int i = 0; i < n; i++) {
            h[i] = lower_bound(v.begin(), v.end(), h[i]) - v.begin();
            a[h[i]]++;
        }
        for (int j = 0; j < m; j++) {
            q[j] = lower_bound(v.begin(), v.end(), q[j]) - v.begin();
            printf("%d\n", a[q[j]]);
            a[q[j]] = 0;
        }
    }
}