#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <map>
#include <cstring>
#include <iterator>
#include <cmath>
#include <algorithm>
#include <stack>
#include <deque>
#include <map>

#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
using namespace std;
int cases;
const int maxn = 1e5+10;
int n;
int tree[maxn<<2];
int col[maxn<<2];

void Pushup( int rt ) {
    tree[rt] = tree[rt<<1] + tree[rt<<1|1];
}

void Pushdown( int rt, int m ) {
    if( col[rt] ) {
        col[rt<<1] = col[rt<<1|1] = col[rt];
        tree[rt<<1] = (m-(m >> 1)) * col[rt];
        tree[rt<<1|1] = (m >> 1) * col[rt];
        col[rt] = 0;
    }
}
void build( int l, int r, int rt ) {
    col[rt] = 0;
    tree[rt] = 1;
    if( l == r ) return;
    int m = (l + r) >> 1;
    build( lson );
    build( rson );
    Pushup(rt);
}

void Update( int L, int R, int x, int l, int r, int rt ) {
    if( L <= l && r <= R ) {
        col[rt] = x;
        tree[rt] = x * (r-l+1);
        return;
    }
    Pushdown( rt, r-l+1 );
    int m = (l + r) >> 1;
    if( L <= m ) Update( L, R, x, lson );
    if( R > m ) Update( L, R, x, rson );
    Pushup( rt );
    return;
}

void debug() {
    for( int i = 1; i <= 40; i++ ) {
        cout << tree[i] << " ";
    }
    cout << endl;
    for( int i = 1; i <= 40; i++ ) {
        cout << col[i] << " ";
    }
    cout << endl;
}

int main() {
    int t;
    scanf( "%d", &t );
    cases = 1;
    while( t-- ) {
        scanf( "%d", &n );
        build( 1, n, 1 );
        debug();
        int m;
        scanf( "%d", &m );
        for( int i = 0; i < m; i++ ) {
            int a, b, c;
            scanf( "%d%d%d", &a, &b, &c );
            Update( a, b, c, 1, n, 1 );
            debug();
        }
//        debug();
//        cout << "===" << endl;
        printf( "Case %d: The total value of the hook is %d.\n", cases++, tree[1] );
    }
    return 0;
}