#include<cstdio>

#define lson l, mid, root<<1
#define rson mid+1, r, root<<1|1
const int N = 100010;
struct node
{
    int l;
    int r;
    int sum;
    int color;
}a[N<<2];

void PushUp(int root)
{
    a[root].sum = a[root<<1].sum + a[root<<1|1].sum;
}
void PushDown(int len, int root)
{
    if(a[root].color)
    {
        a[root<<1].color = a[root<<1|1].color = a[root].color;
        a[root<<1].sum = (len - (len>>1)) * a[root].color;
        a[root<<1|1].sum = (len>>1) * a[root].color;
        a[root].color = 0;
    }
}
void build_tree(int l, int r, int root)
{
    a[root].l = l;
    a[root].r = r;
    a[root].color = 0;

    if(l == r)
    {
        a[root].sum = 1;
        return ;
    }
    int mid = (l + r) >> 1;
    build_tree(lson);
    build_tree(rson);
    PushUp(root);
}
void update(int l, int r, int root, int z)
{
    if(l <= a[root].l && r >= a[root].r)
    {
        a[root].color = z;
        a[root].sum = (a[root].r - a[root].l + 1) * z;
        return;
    }
    PushDown(a[root].r - a[root].l + 1, root);
    int mid = (a[root].l + a[root].r) >> 1;
    if(l <= mid) update(l, r, root<<1, z);
    if(r > mid) update(l, r, root<<1|1, z);
    PushUp(root);
}

int main()
{
    int T, n, m, cas = 0;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        build_tree(1, n, 1);
        scanf("%d",&m);
        int x, y, z;
        while(m--)
        {
            scanf("%d%d%d",&x,&y,&z);
            update(x, y, 1, z);
        }
        int ans = a[1].sum;
        printf("Case %d: The total value of the hook is %d.\n", ++cas, ans);
    }
    return 0;
}