#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define PB push_back
using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned ll;
using namespace std;const int N=3e5+5,M=N*4+5,K=1e5+5,mod=998244353,Mod=mod-1;const ll INF=1e18+7;const db eps=1e-5;mt19937 rnd(time(0));
int n,m,k,x,y,z;
struct Node{ll x,w;Node operator +(const Node &B)const{if(x<B.x) return B;if(x>B.x) return (Node){x,w};return (Node){x,(w+B.w)%mod};};}Cl={-INF,0};
namespace Tree{
	#define ls v<<1
	#define rs v<<1|1
	ll g[M];Node f[M];void Up(int v){f[v]=f[ls]+f[rs];}void PF(int v,ll w){g[v]+=w;f[v].x+=w;}void P(int v){g[v]&&(PF(ls,g[v]),PF(rs,g[v]),g[v]=0);}
	void BD(int l=1,int r=m,int v=1){g[v]=0;if(l==r) {f[v]=(l^1?Cl:(Node){0,1});return;}int m=l+r>>1;BD(l,m,ls);BD(m+1,r,rs);Up(v);}
	void Ins(int x,int y,int z,int l=1,int r=m,int v=1){if(x<=l&&r<=y) return PF(v,z);int m=l+r>>1;P(v);x<=m&&(Ins(x,y,z,l,m,ls),0);y>m&&(Ins(x,y,z,m+1,r,rs),0);Up(v);}
	Node Qry(int x,int y,int l=1,int r=m,int v=1){if(x<=l&&r<=y) return f[v];int m=l+r>>1;P(v);return (x<=m?Qry(x,y,l,m,ls):Cl)+(y>m?Qry(x,y,m+1,r,rs):Cl);}
	void Add(int x,Node y,int l=1,int r=m,int v=1){if(l==r) {f[v]=f[v]+y;return;}int m=l+r>>1;P(v);x<=m?Add(x,y,l,m,ls):Add(x,y,m+1,r,rs);Up(v);}
}
void Solve(){
	int i,j;scanf("%d%d",&n,&m);Tree::BD();while(n--){
		scanf("%d%d%d",&x,&y,&z);if(x>1) Tree::Add(x,Tree::Qry(1,x-1));Tree::Ins(x,y,z);
	}printf("%lld %lld\n",Tree::f[1].x,Tree::f[1].w);
}
int main(){
	int T=0;scanf("%d",&T);while(T--) Solve();
}