[TJOI2018]数学计算 - 洛谷https://www.luogu.com.cn/problem/P4588
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))
int Q, M;
ll tree[MAXN];
void build(int q, int l, int r) {
tree[q] = 1;
if (l == r)
return;
int mid = l + r >> 1;
build(q << 1, l, mid);
build(q << 1 | 1, mid + 1, r);
}
void update(int d, int x, int q, int l, int r) {
if (l == r)
return void(tree[q] = d);
int mid = l + r >> 1;
if (mid >= x)
update(d, x, q << 1, l, mid);
if (mid < x)
update(d, x, q << 1 | 1, mid + 1, r);
tree[q] = tree[q << 1] * tree[q << 1 | 1] % M;
}
inline void solve() {
scanf("%d %d", &Q, &M);
build(1, 1, Q);
int o, m;
for (int i = 1; i <= Q; i++) {
scanf("%d %d", &o, &m);
if (o == 1) {
update(m, i, 1, 1, Q);
printf("%lld\n", tree[1] % M);
} else {
update(1, m, 1, 1, Q);
printf("%lld\n", tree[1] % M);
}
}
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}