#include<bits/stdc++.h>

#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pii pair<int,int>
#define pill pair<int,ll>
#define pll pair<ll,ll>
#define pb push_back
#define fi first
#define se second
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define MASK(x) (((1)<<(x))-1)
#define getbit(x,k) (((x)>>(k))&1)

using namespace std;

const int maxn=1e5+5,mod=1e9+7;
const ll inf=1e18;

int n,m;
vector<pii>eg[maxn];


ll d[maxn],w[maxn],mn[maxn],mx[maxn];
void dijkstra()
{
    fill(d+1,d+1+n,inf);d[1]=0;w[1]=1;
    priority_queue<pll,vector<pll>,greater<pll>>pQ;
    pQ.push({d[1],1});
    while(pQ.size())
    {
        pll u=pQ.top();pQ.pop();
        if(u.fi!=d[u.se]) continue;
        for(pii v:eg[u.se])
        {
            if(u.fi+v.se<d[v.fi])
            {
                d[v.fi]=u.fi+v.se;
                w[v.fi]=w[u.se];
                mn[v.fi]=mn[u.se]+1;
                mx[v.fi]=mx[u.se]+1;
                pQ.push({d[v.fi],v.fi});
            }
            else if(u.fi+v.se==d[v.fi])
            {
                w[v.fi]=(w[v.fi]+w[u.se])%mod;
                mn[v.fi]=min(mn[v.fi],mn[u.se]+1);
                mx[v.fi]=max(mx[v.fi],mx[u.se]+1);
            }
        }
    }
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int u,v,c;cin>>u>>v>>c;
        eg[u].pb({v,c});
    }
    dijkstra();
    if(d[n]==inf) cout<<-1;
    else cout<<d[n]<<' '<<w[n]<<' '<<mn[n]<<' '<<mx[n];
}