1 #include "bits/stdc++.h"
 2 #define lson rt<<1,l,m
 3 #define rson rt<<1|1,m+1,r
 4 using namespace std;
 5 typedef long long LL;
 6 const int MAX=100005;
 7 int cas,n,m;
 8 int c[MAX<<2],t[MAX<<2];
 9 void PushUp(int rt){
10     c[rt]=c[rt<<1]+c[rt<<1|1];
11 }
12 void PushDown(int rt,int m){
13     if (t[rt]){
14         t[rt<<1]=t[rt<<1|1]=t[rt];
15         c[rt<<1]=t[rt<<1]*(m-(m>>1));
16         c[rt<<1|1]=t[rt<<1]*(m>>1);
17         t[rt]=0;
18     }
19 }
20 void build(int rt,int l,int r){
21     t[rt]=1;
22     c[rt]=(r-l+1);
23     if (l==r) return;
24     int m=(l+r)>>1;
25     build(lson);
26     build(rson);
27 }
28 void update(int rt,int l,int r,int x,int y,int z){
29     if (x<=l && r<=y){
30         t[rt]=z;
31         c[rt]=t[rt]*(r-l+1);
32         return;
33     }
34     int m=(l+r)>>1;
35     PushDown(rt,r-l+1);
36     if (x<=m)
37      update(lson,x,y,z);
38     if (y>m)
39      update(rson,x,y,z);
40     PushUp(rt);
41 }
42 int main(){
43     freopen ("hook.in","r",stdin);
44     freopen ("hook.out","w",stdout);
45     int i,j,T;
46     int x,y,z;
47     scanf("%d",&T);
48     while (T--){
49         scanf("%d",&n);
50         build(1,1,n);
51         scanf("%d",&m);
52         for (i=1;i<=m;i++){
53             scanf("%d%d%d",&x,&y,&z);
54             update(1,1,n,x,y,z);
55         }
56         printf("Case %d: The total value of the hook is %d.\n",++cas,c[1]);
57     }
58     return 0;
59 }