#include <cstdio>
#include <stack>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <functional>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <ctime>
#include <cstdlib>
#include <fstream>
#include <string>
#include <sstream>
#include <map>
#include <cmath>
#define LL long long
#define lowbit(x) ((x) & (-x))
#define MP(a, b) make_pair(a, b)
#define MS(arr, num) memset(arr, num, sizeof(arr))
#define PB push_back
#define F first
#define S second
#define ROP freopen("input.txt", "r", stdin);
#define MID(a, b) (a + ((b - a) >> 1))
#define BitCount(x) __builtin_popcount(x)
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
using namespace std;
const int MAXN = 1e5 + 5;
const int MOD = 20071027;
 
typedef pair<int, int> pii;
typedef vector<int>::iterator viti;
typedef vector<pii>::iterator vitii;
 
struct SEGTREE
{
    int col, sum;
}segt[MAXN << 2];
 
void PushDown(int rt, int m)
{
    if (segt[rt].col)
    {
        segt[rt << 1].col = segt[rt << 1|1].col = segt[rt].col;
        segt[rt << 1].sum = (m - (m >> 1)) * segt[rt].col;
        segt[rt << 1|1].sum = (m >> 1) * segt[rt].col;
        segt[rt].col = 0;
    }
}
 
void PushUp(int rt)
{
    segt[rt].sum = segt[rt << 1].sum + segt[rt << 1|1].sum;
}
 
void Update(int rt, int l, int r, int L, int R, int val)
{
    if (L <= l && r <= R)
    {
        segt[rt].col = val;
        segt[rt].sum = val * (r - l + 1);
        return;
    }
    PushDown(rt, r - l + 1);
    int mid = MID(l, r);
    if (L <= mid) Update(rt << 1, l, mid, L, R, val);
    if (R > mid) Update(rt << 1|1, mid + 1, r, L, R, val);
    PushUp(rt);
}
 
void Build(int rt, int l, int r)
{
    segt[rt].col = 0, segt[rt].sum = 1;
    if (l == r) return;
    int mid = MID(l, r);
    Build(rt << 1, l, mid);
    Build(rt << 1|1, mid + 1, r);
    PushUp(rt);
}
 
int main()
{
    //ROP;
    int T, i, j, n, m, cases = 0;
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d", &n);
        Build(1, 1, n);
        scanf("%d", &m);
        int a, b, c;
        while (m--)
        {
            scanf("%d%d%d", &a, &b, &c);
            Update(1, 1, n, a, b, c);
        }
        printf("Case %d: The total value of the hook is %d.\n", ++cases, segt[1].sum);
    }
    return 0;
}