#include <bits/stdc++.h>

using namespace std;

const int N = 5e5 + 50;
const int mod = 998244353;

inline int inc(int x, int y) { x += y - mod; return x + (x >> 31 & mod); }
inline int dec(int x, int y) { x -= y; return x + (x >> 31 & mod); }
inline int mul(int x, int y) { return 1ll * x * y % mod; }

struct value_t {
	long long val;
	int ways;
	value_t() : val(-1e18), ways(0) {}
	value_t(long long val, int ways) : val(val), ways(ways) {}
	value_t operator+(const value_t &rhs) const {
		if (val > rhs.val)
			return *this;
		if (val < rhs.val)
			return rhs;
		return value_t(val, inc(ways, rhs.ways));
	}
} t[N << 2];
long long tag[N << 2];

inline int lc(int o) { return o << 1; }
inline int rc(int o) { return o << 1 | 1; }

void push_up(int o) {
	t[o] = t[lc(o)] + t[rc(o)];
}

void assign(int o, int64_t val) {
	tag[o] += val;
	t[o].val += val;
}

void push_down(int o) {
	if (tag[o]) {
		assign(lc(o), tag[o]);
		assign(rc(o), tag[o]);
		tag[o] = 0;
	}
}

void build(int o, int l, int r) {
	tag[o] = 0;
	if (l == r) {
		t[o] = value_t();
	}
	else {
		const int mid = l + r >> 1;
		build(lc(o), l, mid);
		build(rc(o), mid + 1, r);
		push_up(o);
	}
}

void add(int o, int l, int r, int ql, int qr, int64_t val) {
	if (ql <= l && r <= qr) {
		assign(o, val);
		return;
	}
	push_down(o);
	const int mid = l + r >> 1;
	if (ql <= mid) add(lc(o), l, mid, ql, qr, val);
	if (qr > mid) add(rc(o), mid + 1, r, ql, qr, val);
	push_up(o);
}

value_t query(int o, int l, int r, int ql, int qr) {
	if (ql <= l && r <= qr)
		return t[o];
	const int mid = l + r >> 1;
	push_down(o);
	value_t ans;
	if (ql <= mid)
		ans = ans + query(lc(o), l, mid, ql, qr);
	if (qr > mid)
		ans = ans + query(rc(o), mid + 1, r, ql, qr);
	return ans;
}

void assign(int o, int l, int r, int p, value_t x) {
	if (l == r) {
		t[o] = x;
		return;
	}
	const int mid = l + r >> 1;
	push_down(o);
	if (p <= mid) assign(lc(o), l, mid, p, x);
	else assign(rc(o), mid + 1, r, p, x);
	push_up(o);
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T;
	cin >> T;
	while (T--) {
		int n, m;
		cin >> n >> m;
		build(1, 1, m);
		for (int i = 0; i < n; ++i) {
			int l, r, c;
			cin >> l >> r >> c;
			auto t = value_t(0, 1) + query(1, 1, n, 1, l);
			assign(1, 1, n, l, t);			
			add(1, 1, n, l, r, c);
		}
		cout << t[1].val << " " << t[1].ways << '\n';
	}
}