#include<bits/stdc++.h>
using namespace std;
int n,m;
int ne[4000000],e[4000000],h[2010];
int w[2010][2010];
long long dis[2010],u[2010],l[2010];
priority_queue<pair<int,int> >q;
bool vis[100010];
int idx;
void add(int x,int y){
	e[++idx]=y;
	ne[idx]=h[x];
	h[x]=idx;
}
int main() {
    memset(w,0x3f,sizeof w);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++){
		int x1,y1,w1;
		scanf("%d%d%d",&x1,&y1,&w1);
		if(w[x1][y1]>w1){
			w[x1][y1]=w1;
		}
		else continue;
		add(x1,y1);
	}
	memset(dis,0x3f,sizeof dis);
	dis[1]=0;
	q.push(make_pair(0,1));
	while(q.size()){
		int x=q.top().second;
		q.pop();
		if(vis[x]==1)continue;
		vis[x]=1;
		for(int i=h[x];i;i=ne[i]){
			int y=e[i];
			if(dis[y]>=dis[x]+w[x][y]){
				dis[y]=dis[x]+w[x][y];
				q.push(make_pair(-dis[y],y));
			}
		}
	}
	/*for(int i=1;i<=n;i++){
          if(dis[i]>=0x3f3f3f3f)  printf("0 ");
          else printf("%d ",dis[i]);
}*/
    memset(l,0x3f,sizeof l);
    l[1]=0,u[1]=1;
    memset(vis,0,sizeof vis);
    q.push(make_pair(0,1));
	while(q.size()){
		int x=q.top().second;
		q.pop();
		if(vis[x]==1)continue;
		vis[x]=1;
		for(int i=h[x];i;i=ne[i]){
			int y=e[i];
			if(l[x]>=dis[y])continue;
			if(l[x]+w[x][y]==dis[y]){
				l[y]=dis[y]; 
				u[y]+=u[x]; 
				q.push(make_pair(-l[y],y));
			}
		}
	}
    	if(dis[n]>=0x3f3f3f3f)printf("No answer");
    	else printf("%lld %lld",dis[n],u[n]);
	return 0;
}