Secret Code

Marty is stuck in the past and wants to get back to his own 1985. He has already made his parents fall in love with each other, and he has found plutonium. All that is left is to start the time machine and begin the trip. One problem remains. Starting the time machine requires a secret code, and only Doc knows that code. Marty knows just two things about it: it is made of several different characters, and he knows its length. While he waits for Doc, he guesses the code by entering different combinations of characters.

Doc has come back and entered the correct code. Marty wants to know how close his guesses were. For each of Marty's attempts, find the number of characters that belong to the code and stand in the correct position, and the number of characters that belong to the code but stand in a wrong position.

The first line contains the correct secret code $s$. The code is made of uppercase English letters and digits, and all characters in the code are different, so its length is between 1 and 36.

The second line contains an integer $n$ ($1 \le n \le 10^5$), the number of Marty's attempts.

Each of the next $n$ lines contains one attempt. Every attempt has the same length as $s$, is made of uppercase English letters and digits, and all characters within one attempt are different.

For each attempt print two integers $a$ and $b$ on one line, separated by a space. $a$ is the number of characters that belong to the code and stand in the correct position, and $b$ is the number of characters that belong to the code but stand in a wrong position.