//#include <bits/stdc++.h>

 #include <cstdio>

 #include <cstring>

 #include <iostream>

 #include <algorithm>

 using namespace std;

 const int manx = ;

 struct node

 {

     int l, r, x;

     int Mid()

     {

         return (l+r)/;

     }

 } tree[manx];

 void build (int root, int l, int r)

 {//建树，棍子都为铜质

     tree[root].l = l;

     tree[root].r = r;

     tree[root].x = ;

     if (l == r)

         return ;

     build (*root+, l, tree[root].Mid());

     build (*root+, tree[root].Mid()+, r);

 }

 void update (int root, int l, int r, int s)

 {

     if (tree[root].l==l && tree[root].r==r)

     {//当前区间都为s类型的棍子

         tree[root].x = s;

         return ;

     }

     else if (tree[root].x != -)

     {//当前区间棍子并不一样，需要把当前区间的状态转移到左右子树并标记当前区间

         tree[*root+].x = tree[*root+].x = tree[root].x;

         tree[root].x = -;

     }

     if (r <= tree[root].Mid())

         update (*root+, l, r, s);

     else if (l > tree[root].Mid())

         update (*root+, l, r, s);

     else

     {

         update (*root+, l, tree[root].Mid(), s);

         update (*root+, tree[root].Mid()+, r, s);

     }

 }

 int Sum (int root, int l, int s)

 {

     if (tree[root].x != -)//当前区间棍子类型一样，则不再向下查询

         return tree[root].x * (s - l + );

     else

     {

         return Sum(*root+, l, tree[root].Mid()) + Sum(*root+, tree[root].Mid()+, s);

     }

 }

 int main ()

 {

     int t, l = ;

     scanf ("%d", &t);

     while (t --)

     {

         int n, q;

         scanf ("%d %d", &n, &q);

         build (, , n);

         while (q --)

         {

             int a, b, x;

             scanf ("%d %d %d", &a, &b, &x);

             update (, a, b, x);

         }

         int res = Sum(, , n);

         printf ("Case %d: The total value of the hook is %d.\n", ++l, res);

     }

     return ;

 }