#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#define int long long
#define fi first
#define se second 
#define N 100005
#define inf 2147483647
#define clear(a,c,b) for(int i=1;i<=c;i++)a[i]=b;
struct pii{
	int first,second;
	bool operator==(const pii &p)const{
		return first==p.first;
	}
	bool operator <(const pii &p)const{
		return first<p.first;
	}
};
using namespace std;
int dis[N],n,m,s=1,vis[N],tot,cnt[N];
vector<pii> val[N];
queue<int> q;
void spfa(){
	clear(dis,n,inf);
	q.push(s);
	vis[s]=1;
   cnt[s]=1;
   dis[s]=0;
	while(!q.empty()){
		int x=q.front();
		q.pop();
//		if(vis[x])continue;
//		vis[x]=1;
		for(int i=0;i<val[x].size();i++){
			int v=val[x][i].fi,va=val[x][i].se;
			if(dis[v]>dis[x]+va){
				dis[v]=dis[x]+va;
				cnt[v]=cnt[x];
				if(!vis[v])vis[v]=1,q.push(v);
			}
			else if(dis[v]==dis[x]+va){
				cnt[v]=(cnt[v]+cnt[x]);
			}
		}
		vis[x]=0;
	}
} 
signed main(){
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=m;i++){
		int a,b,c;
		scanf("%lld%lld%lld",&a,&b,&c);
		val[a].push_back({b,c});
	//	val[b].push_back({a,c});
	}
	for(int i=1;i<=n;i++){
		sort(val[i].begin(),val[i].end());
		unique(val[i].begin(),val[i].end());
	}
	spfa();
	if(dis[n]>=2147483647){
		puts("No answer");
	}
	else printf("%lld %lld\n",dis[n],cnt[n]);
	return 0;
}