#include<bits/stdc++.h>
using namespace std;using ll=long long;const int N=2e5+10,mod=998244353;const ll INF=1e18;
int T,n,m,q[N<<2];struct zj{ll x,y;}t[N<<2],ans;
bool operator < (const zj &x,const zj &y){return x.x<y.x;}
zj operator + (const zj &x,const zj &y){return y<x?x:(x<y?y:(zj){x.x,(x.y+y.y)%mod});}
void pushup(int rt){t[rt]=t[rt<<1]+t[rt<<1|1];}
void pushadd(int rt,int x){t[rt].x+=x;q[rt]+=x;}
void pushdown(int rt){if(q[rt])pushadd(rt<<1,q[rt]),pushadd(rt<<1|1,q[rt]),q[rt]=0;}
void build(int l=1,int r=m,int rt=1){
	q[rt]=0;if(l==r)return t[rt]={l==1?0:-INF,l==1?1:0},void();
	int mid=(l+r)>>1;build(l,mid,rt<<1);build(mid+1,r,rt<<1|1);pushup(rt);
}
void update(int x,zj y,int l=1,int r=m,int rt=1){
	if(l==r){t[rt]=t[rt]+y;return;}int mid=(l+r)>>1;pushdown(rt);
	x<=mid?update(x,y,l,mid,rt<<1):update(x,y,mid+1,r,rt<<1|1);pushup(rt);
}
void modify(int L,int R,int x,int l=1,int r=m,int rt=1){
	if(L<=l&&r<=R)return pushadd(rt,x);int mid=(l+r)>>1;pushdown(rt);
	if(L<=mid)modify(L,R,x,l,mid,rt<<1);if(mid<R)modify(L,R,x,mid+1,r,rt<<1|1);pushup(rt);
}
zj query(int L,int R,int l=1,int r=m,int rt=1){
	if(L<=l&&r<=R)return t[rt];int mid=(l+r)>>1;zj s={-INF,0};pushdown(rt);
	if(L<=mid)s=s+query(L,R,l,mid,rt<<1);if(mid<R)s=s+query(L,R,mid+1,r,rt<<1|1);return s;
}
void solve(int l=1,int r=m,int rt=1){
	if(l==r){ans=ans+t[rt];return;}int mid=(l+r)>>1;pushdown(rt);solve(l,mid,rt<<1);solve(mid+1,r,rt<<1|1);
}
void get(){
	scanf("%d%d",&n,&m);build();for(int i=1,x,y,z;i<=n;i++){
		scanf("%d%d%d",&x,&y,&z);zj t;if(x>1){t=query(1,x-1);if(t.x)update(x,t);}modify(x,y,z);
	}ans={-INF,0};solve();printf("%lld %lld\n",ans.x,ans.y);
}
int main(){
	for(scanf("%d",&T);T--;)get();return 0;
}