Number Cards 2

A number card has a single integer written on it. Sanggeun owns N number cards. Given M integers, write a program that counts, for each integer, how many of Sanggeun's cards carry that value.

The first line contains N (1 ≤ N ≤ 500,000), the number of cards Sanggeun owns. The second line contains the N integers written on the cards, separated by spaces. Each of these integers is at least -10,000,000 and at most 10,000,000.

The third line contains M (1 ≤ M ≤ 500,000). The fourth line contains the M integers to be counted, separated by spaces. These integers are also at least -10,000,000 and at most 10,000,000.

Process the M given integers in order and print on the first line, separated by spaces, how many of Sanggeun's cards carry each integer.