hdu1698

/*
区间更新
*/
#include <cstdio>

#include <algorithm>

using namespace std;

#define lson l , m , rt << 1

#define rson m + 1 , r , rt << 1 | 1

const int maxn = ;

int h , w , n;

int col[maxn<<];

int sum[maxn<<];

void PushUp(int rt) {

         sum[rt] = sum[rt<<] + sum[rt<<|];

}

void PushDown(int rt,int m) {

         if (col[rt]) {

                 col[rt<<] = col[rt<<|] = col[rt];

                 sum[rt<<] = (m - (m >> )) * col[rt];

                 sum[rt<<|] = (m >> ) * col[rt];

                 col[rt] = ;

         }

}

void build(int l,int r,int rt) {

         col[rt] = ;

         sum[rt] = ;

         if (l == r) return ;

         int m = (l + r) >> ;

         build(lson);

         build(rson);

         PushUp(rt);

}

void update(int L,int R,int c,int l,int r,int rt) {

         if (L <= l && r <= R) {

                 col[rt] = c;

                 sum[rt] = c * (r - l + );

                 return ;

         }

         PushDown(rt , r - l + );

         int m = (l + r) >> ;

         if (L <= m) update(L , R , c , lson);

         if (R > m) update(L , R , c , rson);

         PushUp(rt);

}

int main() {

         int T , n , m;

         scanf("%d",&T);

         for (int cas =  ; cas <= T ; cas ++) {

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

                 build( , n , )

                 while (m --) {

                          int a , b , c;

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

                          update(a , b , c ,  , n , );

                 }

                 printf("Case %d: The total value of the hook is %d.\n",cas , sum[]);

         }

         return ;

}