#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <set>
using namespace std;

int hash[8000006];
int nn[8000006];

int main() {
    int n, m;
    int tmp;
    while (scanf("%d %d", &n, &m) != EOF) {
        memset(hash, 0, sizeof(hash));
        memset(nn, 0, sizeof(nn));

        for (int i = 0; i < n; i++) {
            scanf("%d", &tmp);

            int po = tmp % 7986543;
            while (nn[po] != tmp && nn[po] != 0) {
                po = (po + 1) % 7986543;
            }
            if (nn[po] == 0) {
                nn[po] = tmp;
            }

            hash[po]++;
        }

        for (int i = 0; i < m; i++) {
            scanf("%d", &tmp);

            int po = tmp % 7986543;
            while (nn[po] != tmp && nn[po] != 0) {
                po = (po + 1) % 7986543;
            }

            if (po < 0) {
                puts("0");
            } else {
                printf("%d\n", hash[po]);
                hash[po] = 0;
            }
        }
    }
}