题目1156：谁是你的潜在朋友

运用计数排序的方法：

import java.util.Scanner;
import java.io.IOException;
import java.io.FileReader;

class Main
{
	public static final boolean DEBUG = false;

	public static void main(String[] args) throws IOException 
	{
		Scanner cin;
		int n, m;
		
		if (DEBUG) {
			cin = new Scanner(new FileReader("e:\\uva_in.txt"));
		} else {
			cin = new Scanner(System.in); 
		}
		
		while (cin.hasNext()) {
			n = cin.nextInt();
			m = cin.nextInt();
			
			int[] cnt = new int[m];
			int[] a = new int[n];
			
			for (int i = 0; i < n; i++) {
				int p = cin.nextInt();
				a[i] = --p;
				cnt[p]++;
			}
			
			for (int i = 0; i < n; i++) {
				if (cnt[a[i]] == 0) continue;
				
				if (cnt[a[i]] == 1) System.out.println("BeiJu");
				else System.out.println(cnt[a[i]] - 1);
			}
		}
	}
}