Passwords are widely used in our lives: for ATMs, online forum logins, mobile device unlock and door access. Everyone cares about password security. However, attackers always find ways to steal our passwords. Here is one possible situation:
Assume that Eve, the attacker, wants to steal a password from the victim Alice. Eve cleans up the keyboard beforehand. After Alice types the password and leaves, Eve collects the fingerprints on the keyboard. Now she knows which keys are used in the password. However, Eve won't know how many times each key has been pressed or the order of the keystroke sequence.
To simplify the problem, let's assume that Eve finds Alice's fingerprints only occurs on keys. And she knows, by another method, that Alice's password contains characters. Furthermore, every keystroke on the keyboard only generates a single, unique character. Also, Alice won't press other irrelevant keys like 'left', 'home', 'backspace' and etc.
Here's an example. Assume that Eve finds Alice's fingerprints on key '3', '7' and '5', and she knows that Alice's password is -digit in length. So all the following passwords are possible: , , and . (And, in fact, there are more possible passwords.)
However, these passwords are not possible:
Password Example
Reason
1357
There is no fingerprint on key '1'
3355
There is fingerprint on key '7', so '7' must occur at least once.
357
Eve knows the password must be a 4-digit number.
With the information, please count that how many possible passwords satisfy the statements above. Since the result could be large, please output the answer modulo .
输入格式
The first line of the input gives the number of test cases, . For the next lines, each contains two space-separated numbers and , indicating a test case.
输出格式
For each test case, output one line containing "Case #x: y", where is the test case number (starting from ) and is the total number of possible passwords modulo .
样例
样例输入 1
4
1 1
3 4
5 5
15 15
样例输出 1
Case #1: 1
Case #2: 36
Case #3: 120
Case #4: 674358851
