#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
inline int read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')s=s*10+(ch-'0'),ch=getchar();
	return s*w;
}
const int MAXN=2010;
int n,m,d[MAXN],cnt[MAXN];
int G[MAXN][MAXN];
int head[MAXN],tot;
struct E{int to,nxt,cost;};
E edge[MAXN*MAXN];
inline int Max(int x,int y){return x>y?x:y;}
inline void add_edge(int u,int v,int w)
{
	edge[++tot].nxt=head[u];
	head[u]=tot;
	edge[tot].to=v;
	edge[tot].cost=w;
	return;
}
typedef pair<int,int>P;
inline void dijkstra(int s)
{
	priority_queue<P,vector<P>,greater<P> >q;
	for(register int i=1;i<=n;i++) d[i]=1e9;
	d[s]=0;
	cnt[s]=1;
	q.push(make_pair(0,s));
	while(!q.empty())
	{
		P p=q.top();
		q.pop();
		int v=p.second;
		if(d[v]<p.first) continue;
		for(register int i=head[v];i;i=edge[i].nxt)
		{
			E e=edge[i];
			if(d[e.to]>d[v]+e.cost)
			{
				d[e.to]=d[v]+e.cost;
				cnt[e.to]=cnt[v];
				q.push(make_pair(d[e.to],e.to));
			}
			else if(d[e.to]==d[v]+e.cost) cnt[e.to]+=cnt[v];
		}
	}
}
int main()
{
	n=read(),m=read();
	while(m--)
	{
		int u=read(),v=read(),w=read();
		G[u][v]=Max(G[u][v],w);
	}
	for(register int i=1;i<=n;i++)
		for(register int j=1;j<=n;j++)
			if(G[i][j]!=0) add_edge(i,j,G[i][j]);
	dijkstra(1);
	d[n]==1e9?puts("No answer"):printf("%d %d\n",d[n],cnt[n]);
	return 0;
}