#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#define inf 0x3f3f3f3f
using namespace std;
struct node {
	int dis,tt;
	bool operator >(const node &a) const
	{
		return dis>a.dis;
	}
};
priority_queue<node,vector<node>,greater<node> > q;
int n,m,a,b,c,idx=1,e[2005],w[2005],h[2000005],ne[2000005],dis[2000005],ans[2000005];
bool bo[2000005],bol[2005][2005];
void add(int a,int b,int c)
{
	e[idx]=b;
	w[idx]=c;
	ne[idx]=h[a];
	h[a]=idx++;
}
void dij()
{
	fill(dis+1,dis+n+1,inf);
	dis[1]=0;
	ans[1]=1;
	q.push({0,1});
	while(!q.empty())
	{
		int t=q.top().tt;
		q.pop();
		if (bo[t])
		{
			continue;
		}
		bo[t]=true;
		for(int i=h[t];i>=1;i=ne[i])
		{
			if (dis[e[i]]>dis[t]+w[i])
			{
				dis[e[i]]=dis[t]+w[i];
				q.push({dis[e[i]],e[i]});
				ans[e[i]]=0;
			}
			if (dis[e[i]]==dis[t]+w[i])
			{
				ans[e[i]]+=ans[t];
			}
		}
	}
}
int main()
{
	scanf("%d %d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		scanf("%d %d %d",&a,&b,&c);
		if (!bol[a][b])
		{
			add(a,b,c);
			bol[a][b]=true;
			continue;
		}
		for(int i=h[a];i>=1;i=ne[i])
		{
			if (e[i]==b)
			{
				w[i]=min(w[i],c);
				break;
			}
		}
	}
	dij();
	if (dis[n]==inf)
	{
		printf("No answer");
	}
	else
	{
		printf("%d %d",dis[n],ans[n]);
	}
	return 0;
}