//目前还不知道哪错了..............
#include<cstdio>
#include<iostream>
using namespace std;
typedef long long LL;
LL n, m, ans, x, y, op, val;//因为下面有的函数需要用到x,y,val值,懒得传参,故直接写为全局变量
const int N = 100000;
struct Node{
LL l, r, sum, lazy;//左孩子,右孩子,求和,懒惰标记
}tree[N<<2+5];//一般会开为给定最大数组的4倍
//构建树
void Build(int k, int l, int r)
{
//(l, r)为一个区间 类似于(1, 10)--》(1, 5)(6, 10)--》.....
tree[k].l = l;//l为该子树的最小值
tree[k].r = r;//r为该子树的最大值
tree[k].lazy = 1;
if(tree[k].l == tree[k].r) {
tree[k].sum = 1;
return ;
}
LL mid=(tree[k].l+tree[k].r)>>1;
Build(k<<1, l, mid);//构建左子树 即(2*k)
Build(k<<1|1, mid+1, r);//构建右子树 即(2*k+1)
//因为是递归构造树,所以求该K节点的sum即可用以下式子直接求出(相当于递归到叶子结点,然后从叶子结点往上更新父节点的值)
tree[k].sum = tree[k<<1].sum+tree[k<<1|1].sum;
}
//向下传递懒惰标记,传递完后该节点的懒惰标记归0
void PushDown(LL k)
{
/* tree[k<<1].sum -= (tree[k<<1].r-tree[k<<1].l+1)*tree[k<<1].lazy;
tree[k<<1|1].sum -= (tree[k<<1|1].r-tree[k<<1|1].l+1)*tree[k<<1|1].lazy;
*/
tree[k<<1].lazy = tree[k].lazy;
tree[k<<1|1].lazy = tree[k].lazy;
/*
tree[k<<1].sum += (tree[k<<1].r-tree[k<<1].l+1)*tree[k].lazy;
tree[k<<1|1].sum += (tree[k<<1|1].r-tree[k<<1|1].l+1)*tree[k].lazy;
*/
tree[k<<1].sum = (tree[k<<1].r-tree[k<<1].l+1)*tree[k].lazy;
tree[k<<1|1].sum = (tree[k<<1|1].r-tree[k<<1|1].l+1)*tree[k].lazy;
tree[k].lazy=1;
}
//区间更新
void UpdateSQ(LL k)
{
//若(x, y)区间包含该节点的区间,则更新该节点的sum值和懒惰标记
if(tree[k].l>=x && tree[k].r<=y){
/*tree[k].sum -= (tree[k].r-tree[k].l+1)*tree[k].lazy;
tree[k].sum += (tree[k].r-tree[k].l+1)*val;
*/
//好像还有一种写法
tree[k].sum = (tree[k].r-tree[k].l+1)*val;
tree[k].lazy = val;
return ;
}
//因为(x, y)不能完全包含该节点的区间,将懒惰标记传给他的孩子,继续向下更新
if(tree[k].lazy != 1)
PushDown(k);
LL mid=(tree[k].l+tree[k].r)>>1;
if(x <= mid)
UpdateSQ(k<<1);
if(y > mid)
UpdateSQ(k<<1|1);
//更新父节点方法与Build里的一样
tree[k].sum=tree[k<<1].sum+tree[k<<1|1].sum;
}
int main()
{
int t;
// cin >> t;
scanf("%d", &t);
int cnt = 1;
while(t--){
//cin >> n >> m;
scanf("%d%d", &n, &m);
//从上向下构建树
Build(1, 1, n);
for(int i=1; i<=m; i++) {
// cin >> x >> y >> val;
scanf("%d%d%d", &x, &y, &val);
//从上开始查找是否在更新区间内,若能直接更新则更新,否则一直缩小区间 ,(要注意此题是替换,不是直接加和,所以之前的加和会随替换的改变而改变,需要在替换之前减去被替换区域的值)
UpdateSQ(1);
// printf("Updated is %d ", tree[1].sum);
}
printf("Case %d: The total value of the hook is %d.\n", cnt++, tree[1].sum);
}
return 0;
}