#include <bits/stdc++.h>
using namespace std;
struct INIT{INIT(){ios::sync_with_stdio(false);cin.tie(0);}}init;
namespace myhash{
    const int Bsizes[]={3,9,13,17,21,25,29,33,37,41,45,49,53,57,61,65,69,73,77,81};// num=20
    const int xor_nums[]={0x100007d1,0x5ff049c9,0x14560859,0x07087fef,0x3e277d49,0x4dba1f17,0x709c5988,0x05904258,0x1aa71872,0x238819b3,0x7b002bb7,0x1cf91302,0x0012290a,0x1083576b,0x76473e49,0x3d86295b,0x20536814,0x08634f4d,0x115405e8,0x0e6359f2};
    const int hash_key=xor_nums[rand()%20];
    template <typename T>
    struct myhash{
        inline std::size_t operator()(const T& val) const {
            return val^hash_key;
        }
    };
};
template <typename T>
class myhash_set:public std::unordered_set<T,myhash::myhash<T>> {
    using SET=std::unordered_set<T,myhash::myhash<T>>;
public:
    myhash_set():SET(){SET::rehash(myhash::Bsizes[rand()%20]);}
};
template <typename T,typename U>
class myhash_map:public std::unordered_map<T,U,myhash::myhash<T>> {
public:
    using MAP=unordered_map<T,U,myhash::myhash<T>>;
    myhash_map():MAP(){MAP::rehash(myhash::Bsizes[rand()%20]);}
};
typedef long long LL;

int main() {
    int N,M;
    cin >> N >> M;
    myhash_map<LL,int> cnt;
    for(int i = 0; i < N; i++){
        LL a;cin >> a;
        cnt[a]++;
    }
    for(int i = 0; i < M; i++){
        LL b;cin >> b;
        cout << (!i)+" " << cnt[b];
    }cout << endl;
    return 0;
}