/**
* ┏┓ ┏┓
* ┏┛┗━━━━━━━┛┗━━━┓
* ┃ ┃
* ┃ ━ ┃
* ┃ ＞ ＜ ┃
* ┃ ┃
* ┃... ⌒ ... ┃
* ┃ ┃
* ┗━┓ ┏━┛
* ┃ ┃ Code is far away from bug with the animal protecting
* ┃ ┃ 神兽保佑,代码无bug
* ┃ ┃
* ┃ ┃
* ┃ ┃
* ┃ ┃
* ┃ ┗━━━┓
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━━━━━━━━┳┓┏┛
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-12
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define NM 30005
#define nm 120005
#define N 1000005
#define pi 3.1415926535897931
const int inf=1000000007;
using namespace std;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
struct edge{int t,v;edge*next;}e[nm],*h[NM],*o=e;
void add(int x,int y,int v){o->t=y;o->v=v;o->next=h[x];h[x]=o++;}
int n,m,root,smin,tot,size[NM],ans1,a[NM],b[NM],p,_x,_y,_t,cnt,w[NM],c[NM],d[NM],ans;
bool v[NM];
struct tmp{
int x,d;
bool operator<(const tmp&o)const{return d>o.d||(d==o.d&&x>o.x);}
};
priority_queue<tmp>q;
void dij(){
q.push(tmp{1,0});inc(i,2,n)d[i]=inf;
while(!q.empty()){
int t=q.top().x;q.pop();
link(t)if(d[j->t]>d[t]+j->v)b[j->t]=t,q.push(tmp{j->t,d[j->t]=d[t]+j->v});
}
}
void dfs1(int x,int f){size[x]=1;link(x)if(!v[j->t]&&j->t!=f)dfs1(j->t,x),size[x]+=size[j->t];}
void getroot(int x,int f){
int s=tot-size[x];
link(x)if(!v[j->t]&&j->t!=f)getroot(j->t,x),s=max(s,size[j->t]);
if(s<smin)smin=s,root=x;
}
void dfs2(int x,int f){
b[++cnt]=x;
if(w[x]<p)if(ans<c[p-w[x]]+d[x])ans=c[p-w[x]]+d[x],ans1=a[p-w[x]];
else if(ans==c[p-w[x]]+d[x])ans1+=a[p-w[x]];
link(x)if(!v[j->t]&&j->t!=f)d[j->t]=d[x]+j->v,w[j->t]=w[x]+1,dfs2(j->t,x);
}
void div(int x){
dfs1(x,0);
tot=size[x];smin=n;
getroot(x,0);
v[root]++;a[1]=1;
link(root)if(!v[j->t]){
cnt=0;
d[j->t]=j->v;w[j->t]=1;
dfs2(j->t,root);
for(int k=1,i=b[k];k<=cnt;i=b[++k])
if(c[w[i]+1]<d[i])c[w[i]+1]=d[i],a[w[i]+1]=1;
else if(c[w[i]+1]==d[i])a[w[i]+1]++;
}
inc(i,2,n)if(c[i]||a[i])c[i]=0,a[i]=0;else break;
link(root)if(!v[j->t])div(j->t);
}
int main(){
n=read();m=read();p=read();
inc(i,1,m){_x=read();_y=read();_t=read();add(_x,_y,_t);add(_y,_x,_t);}
dij();
inc(i,2,n)link(i)if(b[i]==j->t)a[i]=j->v;
mem(e);mem(h);o=e;
inc(i,2,n)add(b[i],i,a[i]),add(i,b[i],a[i]);
//inc(i,1,n)printf("%d ",b[i]);putchar('\n');
mem(a);mem(b);
div(1);
return 0*printf("%d %d\n",ans,ans1);
}
