#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define ull unsigned long long 
#define vi vector <int> 
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
using namespace std;
const int N = 1 << 19, mod = 998244353;
int l[N], r[N];

ll tag[N];
struct node {
	ll mx;
	int count;
	node (ll MX = 0, int C = 0) {
		mx = MX, count = C;
	}
} f[N];
node operator + (node a, node b) {
	return node(max(a.mx, b.mx), ((a.mx >= b.mx ? a.count : 0) + (a.mx <= b.mx ? b.count : 0)) % mod);
}

void upd(int x) {
	f[x] = f[x << 1] + f[x << 1 | 1];
}

void build(int x, int L, int R) {
	tag[x] = 0;
	if(L == R) {
		if(L == 1) f[x] = node(0, 1);
		else f[x] = node(-1e18, 0);
		return ;
	} 
	int mid = (L + R) >> 1; 
	build(x << 1, L, mid), build(x << 1 | 1, mid + 1, R), upd(x);
}
void ad(int x, ll w) {
	tag[x] += w, f[x].mx += w;
}
void push(int x) {
	if(tag[x]) ad(x << 1, tag[x]), ad(x << 1 | 1, tag[x]), tag[x] = 0;
}
node get(int x, int L, int R, int l, int r) {
	if(l <= L && R <= r) return f[x];
	int mid = (L + R) >> 1; push(x);
	if(l <= mid && r > mid) return get(x << 1, L, mid, l, r) + get(x << 1 | 1, mid + 1, R, l, r);
	else if(l <= mid) return get(x << 1, L, mid, l, r);
	else return get(x << 1 | 1, mid + 1, R, l, r);
} 

void add(int x, int L, int R, int l, int r, int w) {
	if(l <= L && R <= r) return ad(x, w), void();
	int mid = (L + R) >> 1; push(x); 
	if(l <= mid) add(x << 1, L, mid, l, r, w);
	if(r > mid) add(x << 1 | 1, mid + 1, R, l, r, w);
	upd(x);
} 
void mark(int x, int L, int R, int p, node w) {
	if(L == R) return f[x] = f[x] + w, void();
	int mid = (L + R) >> 1; push(x);
	p <= mid ? mark(x << 1, L, mid, p, w) : mark(x << 1 | 1, mid + 1, R, p, w); upd(x);
} 
int n, m, ql[N], qr[N], qc[N];
void Main() {
	cin >> m >> n;
	build(1, 1, n);
	L(i, 1, m) {
		cin >> ql[i] >> qr[i] >> qc[i];
		add(1, 1, n, ql[i], qr[i], qc[i]);
		if(ql[i] > 1) {
			node z = get(1, 1, n, 1, ql[i] - 1);
			z.mx += qc[i], mark(1, 1, n, ql[i], z);
		}
	}
	cout << f[1].mx << ' ' << f[1].count << '\n';
}
int main () {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int t;
	cin >> t;
	while(t--) Main();
	return 0;
}