#include<iostream>
using namespace std;
struct Node{
    int left,right;
    int s;
}a[400010];
void built(int cur,int x,int y){
    a[cur].left=x;
    a[cur].right=y;
    a[cur].s=1;
    if(x<y){
        int mid=(x+y)>>1;
        built(cur<<1,x,mid);
        built(cur<<1 | 1,mid+1,y);
    }
}
void insert(int val,int cur,int x,int y){
    if(a[cur].left==x && a[cur].right==y){
        a[cur].s=val;
        return ;
    }
    if(a[cur].left==a[cur].right){
        a[cur].s=val;
        return ;
    }
    if(a[cur].s){
        a[cur<<1].s=a[cur<<1 | 1].s=a[cur].s;
        a[cur].s=0;
    }
    int mid=(a[cur].right+a[cur].left)>>1;
    if(y<=mid)
        insert(val,cur<<1,x,y);
    else if(x>mid)
        insert(val,cur<<1 |1,x,y);
    else{
        insert(val,cur<<1,x,mid);
        insert(val,cur<<1 | 1,mid+1,y);
    }
}
int sum(int cur,int x,int y){
    if(a[cur].s){
        //cout<<a[cur].s<<' '<<a[cur].left<<' '<<a[cur].right<<endl;
        return (1+a[cur].right-a[cur].left)*a[cur].s;
    }
    int mid=(x+y)>>1;
    return sum(cur<<1,x,mid)+sum(cur<<1 |1,mid+1,y);
}
int main(){
    int T; cin>>T;
    for(int j=1;j<=T;j++){
        int n; cin>>n;
        built(1,1,n);
        int t; cin>>t;
        for(int i=0;i<t;i++){
            int x,y,val;
            cin>>x>>y>>val;
            insert(val,1,x,y);
        }
        cout<<"Case "<<j<<": The total value of the hook is "<<sum(1,1,n)<<'.'<<endl;
    }
    return 0;
}