An easy problem

One day, a useless calculator was being built by Kuros. Let's assume that number X is showed on the screen of calculator. At first, X = 1. This calculator only supports two types of operation.
1. multiply X with a number.
2. divide X with a number which was multiplied before.
After each operation, please output the number X modulo M.

The first line is an integer T($1 \leq T \leq 10$), indicating the number of test cases.
For each test case, the first line are two integers Q and M. Q is the number of operations and M is described above. ($1 \leq Q \leq 10^5, 1 \leq M \leq 10^9$)
The next Q lines, each line starts with an integer x indicating the type of operation.
if x is 1, an integer y is given, indicating the number to multiply. ($0 < y \leq 10^9$)
if x is 2, an integer n is given. The calculator will divide the number which is multiplied in the nth operation. (the nth operation must be a type 1 operation.)

It's guaranteed that in type 2 operation, there won't be two same n.

For each test case, the first line, please output "Case #x:" and x is the id of the test cases starting from 1.
Then Q lines follow, each line please output an answer showed by the calculator.

1
10 1000000000
1 2
2 1
1 2
1 10
2 3
2 4
1 6
1 7
1 12
2 7

Case #1:
2
1
2
20
10
1
6
42
504
84

2015 ACM/ICPC Asia Regional Shanghai Online