#include<cmath>

#include<queue>

#include<cstdio>

#include<cctype>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

typedef long long ll;

const int Q=1e5+;

inline ll read(){

    ll X=,w=;char ch=;

    while(!isdigit(ch)){w|=ch=='-';ch=getchar();}

    while(isdigit(ch))X=(X<<)+(X<<)+(ch^),ch=getchar();

    return w?-X:X;

}

int q;

ll p,tr[Q*];

inline void upt(int a){tr[a]=tr[a<<]*tr[a<<|]%p;}

void build(int a,int l,int r){

    if(l==r){

    tr[a]=;return;

    }

    int mid=(l+r)>>;

    build(a<<,l,mid);build(a<<|,mid+,r);

    upt(a);

}

void mdy(int a,int l,int r,int x,ll y){

    if(l==r){

    tr[a]=y;

    return;

    }

    int mid=(l+r)>>;

    if(x<=mid)mdy(a<<,l,mid,x,y);

    else mdy(a<<|,mid+,r,x,y);

    upt(a);

}

int main(){

    int T=read();

    while(T--){

    q=read(),p=read();

    build(,,q);

    for(int i=;i<=q;i++){

        int op=read();

        if(op==){

        ll m=read();

        mdy(,,q,i,m);

        }else{

        int pos=read();

        mdy(,,q,pos,);

        }

        printf("%lld\n",tr[]);

    }

    }

    return ;

}