#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;
const int maxn = 2e5 + 20;
struct Node {int L, R, id;
}one[maxn], two[maxn];
bool cmp1(struct Node a, struct Node b) {return a.L < b.L;
}
bool cmp2(struct Node a, struct Node b) {return a.R < b.R;
}
int idForJoke[maxn];
int has[maxn];
set<int>ss;
void work() {ss.clear();memset(has, 0, sizeof has);int n, m;scanf("%d%d", &n, &m);for (int i = 1; i <= m; ++i) {int pos, joke, dis;scanf("%d%d%d", &pos, &joke, &dis);one[i].L = max(1, pos - dis), one[i].R = min(n, pos + dis), one[i].id = i;two[i] = one[i];idForJoke[i] = joke;}sort(one + 1, one + 1 + m, cmp1);sort(two + 1, two + 1 + m, cmp2);int ans = 0, p1 = 1, p2 = 1;for (int i = 1; i <= n; ++i) {while (p1 <= m && i >= one[p1].L) {ss.insert(one[p1].id);has[idForJoke[one[p1].id]]++;++p1;}while (p2 <= m && i > two[p2].R) {ss.erase(two[p2].id);has[idForJoke[two[p2].id]]--;++p2;}if (ss.size()) {ans += has[idForJoke[*ss.rbegin()]] > 1;} else ans++;}printf("%d\n", ans);
}int main() {
#ifdef localfreopen("data.txt", "r", stdin);
//    freopen("data.txt", "w", stdout);
#endifint t;scanf("%d", &t);while (t--) work();return 0;
}

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <assert.h>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <bitset>
LL n, m;
int k;
const int maxn = 20 + 2;
int x[maxn], y[maxn];
LL ans;
void dfs(int cur, int sel, int x1, int y1, int x2, int y2) {if (cur == k + 1) {if (!sel) return;LL res = (x1) * (n - x2 + 1) * (y1) * (m - y2 + 1);if (sel & 1) ans -= res;else ans += res;return;}dfs(cur + 1, sel + 1, min(x1, x[cur]), min(y1, y[cur]), max(x2, x[cur]), max(y2, y[cur]));dfs(cur + 1, sel, x1, y1, x2, y2);
}void work() {scanf("%d%d%d", &n, &m, &k);for (int i = 1; i <= k; ++i) {scanf("%d%d", &x[i], &y[i]);}ans = (n + 1) * n / 2 * (m + 1) * m / 2;dfs(1, 0, inf, inf, -inf, -inf);cout << ans << endl;
}int main() {
#ifdef localfreopen("data.txt", "r", stdin);
//    freopen("data.txt", "w", stdout);
#endifint t;scanf("%d", &t);while (t--) work();return 0;
}

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <assert.h>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <bitset>
#include <time.h>
const int maxn = 5e3 + 20;
char str[maxn];
bool book[maxn];
int p[maxn];
int manacher(char str[], int lenstr) {str[0] = '*';for (int i = lenstr; i >= 0; --i) {str[i + i + 2] = str[i + 1];str[i + i + 1] = '#';}int id = 0, maxLen = 0;for (int i = 2; i <= 2 * lenstr + 1; ++i) {if (!book[str[i]]) {p[i] = 0;continue;}if (p[id] + id > i) {p[i] = min(p[id] + id - i, p[2 * id - i]);} else p[i] = 1;while (str[i + p[i]] == str[i - p[i]] && (book[str[i - p[i]]] || str[i - p[i]] == '#')) ++p[i];if (p[id] + id < p[i] + i) id = i;maxLen = max(maxLen, p[i]);}return maxLen - 1;
}
void work() {scanf("%s", str + 1);int lenstr = strlen(str + 1);bool flag = false;for (int i = 1; i <= lenstr; ++i) {if (book[str[i]]) {flag = true;break;}}if (!flag) {printf("0\n");return;}printf("%d\n", manacher(str, lenstr));
}