#include<iostream>
#include<cstring>
#include<queue>
#define int long long
const long long N=2e3+10;
const long long INF=0x3f3f3f3f;

using namespace std;
int to[N],head[N],ne[N],edge[N],tot,d[N],v[N],cnt,n,m,num[N],fa[N][N][20];
priority_queue<pair<int , int> >q;
inline void add(int x,int y,int z)
{
	to[++tot]=y;
	edge[tot]=z;
	ne[tot]=head[x];
	head[x]=tot;
}
inline void dij()
{
	for(int i=0;i<=n;i++)
	{
		d[i]=INF;
	}
	d[1]=0;
	num[1]=1;
	q.push(make_pair(0,1));
	while(q.size())
	{
		int x=q.top().second;
		q.pop();
		if(v[x])
		{
			continue; 
		}
		v[x]=1;
		for(int i=head[x];i;i=ne[i])
		{
			int y=to[i],z=edge[i];
			if(d[y]==d[x]+z)
			{
				num[y]+=num[x];
			}
			if(d[y]>d[x]+z)
			{
				d[y]=d[x]+z;
				q.push(make_pair(-d[y],y));
				num[y]=num[x];
			}
		}
	}
}
signed main()
{
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		int u,v,w;
		cin>>u>>v>>w;
		if(!fa[u][v][w])
		{
			fa[u][v][w]=1;
			add(u,v,w);
		}
	}
	dij();
	if(d[n]==INF)
	{
		cout<<"No answer"<<endl;
	}
	else cout<<d[n]<<" "<<num[n]<<endl;
	return 0;
}