- 哈希表 直接过
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 210;
int a[N];
int hashs[N];
int n,m;
int main()
{
cin>>n>>m;
for (int i = 0; i < n; i ++ )cin>>a[i],hashs[a[i]]++;
for (int i = 0; i < n; i ++ )
if(hashs[a[i]]==1)cout<<"BeiJu\n";
else cout << hashs[a[i]]-1<<"\n";
return 0;
}