# include <iostream>

 # include <cstdio>

 # include <cstring>

 # include <algorithm>

 # include <string>

 # include <cmath>

 # include <queue>

 # include <list>

 # define LL long long

 using namespace std ;

 const int maxn = ;

 int MOD ;

 LL sum[maxn<<] ; //结点开4倍

 void PushUP(int rt) //更新到父节点

 {

     sum[rt] = (sum[rt * ] * sum[rt *  + ]) % MOD ; //rt 为当前结点

 }

 void build(int l , int r , int rt) //构建线段树

 {

     if (l == r)

     {

         sum[rt] =  ;

         return ;

     }

     int m = (l + r) /  ;

     build(l , m , rt * ) ;

     build(m +  , r , rt *  +) ;

     PushUP(rt) ;

 }

 void updata(int p , LL v , int l , int r , int rt)

 {

     if (l == r)

     {

         sum[rt] = v % MOD ;

         return ;

     }

     int m = (l + r) /  ;

     if (p <= m)

        updata(p , v , l , m , rt * ) ;

     else

        updata(p , v , m +  , r , rt *  + ) ;

     PushUP(rt) ;

 }

 int main()

 {

     //freopen("in.txt","r",stdin) ;

     int T ;

     scanf("%d" , &T) ;

     int Case =  ;

     while(T--)

     {

         Case++ ;

         int n ;

         scanf("%d %d" , &n , &MOD) ;

         build(,n,) ;

         int i , op ;

         LL y ;

         printf("Case #%d:\n", Case);

         for (i =  ; i <= n ; i++)

         {

             scanf("%d %I64d" , &op , &y) ;

             if (op == )

                 updata(i , y ,  , n , ) ;

             if (op == )

                 updata(y ,  ,  , n , ) ;

             printf("%I64d\n", sum[]);

         }

     }

     return ;

 }