#include<bits/stdc++.h>
#define ll long long 
using namespace std;
const int N=2e3+10;
const int inf=0x3f3f3f3f;
int n,m;
ll ma[N][N],dis[N],sum[N];
int h[N],cnt;
bool vis[N];
struct node{
  int nxt,to;
  ll val;  
}e[N*N];
struct point{
    int num;
    ll dis;
    bool operator < (const point &x) const{
        return dis>x.dis;
    }
};
priority_queue<point> q;
inline ll read(){
    ll 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;
}
void add(int u,int v,ll w){
    e[++cnt].nxt=h[u];
    e[cnt].to=v;
    e[cnt].val=w;
    h[u]=cnt;
}
void dij(){
    //memset(dis,inf,sizeof(dis));
    for(int i=2;i<=n;i++) dis[i]=inf;
    sum[1]=1;dis[1]=0;q.push(point{1,0});
    while(!q.empty()){
        point t=q.top();q.pop();
        int u=t.num;vis[u]=0;
        for(int i=h[u];i;i=e[i].nxt){
            int v=e[i].to;
            if(dis[v]>dis[u]+e[i].val){
                dis[v]=dis[u]+e[i].val;
                sum[v]=sum[u];
                if(!vis[v]){
                    vis[v]=1;
                    q.push(point{v,dis[v]});
                }
            }
            else if(dis[v]==dis[u]+e[i].val) sum[v]+=sum[u];
        }
    }
}
int main(){
    n=read();m=read();
    ll u,v,w;
    memset(ma,inf,sizeof(ma));
    while(m--){
        u=read();v=read();w=read();
        if(ma[u][v]>w) ma[u][v]=w;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(ma[i][j]!=inf) add(i,j,ma[i][j]);
        }
    }
    dij();
    if(dis[n]==inf) puts("No answer");
    else printf("%lld %lld",dis[n],sum[n]);
    return 0;
}