#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define PA pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
//using mint=modint1000000007;
using mint=modint998244353;
//const ll mod=1000000007;
const ll mod=998244353;
//using mint=modint;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}
int main(){
  ll N,M;cin>>N>>M;
  vector<pair<ll,PA>>E(M);
  REP(i,M){
    cin>>E[i].S>>E[i].F;
    E[i].S.F--;E[i].S.S--;
  }
  sort(ALL(E));reverse(ALL(E));
  dsu D(N);ll t=0;
  while(!D.same(0,N-1)){
    D.merge(E[t].S.F,E[t].S.S);t++;
  }
  ll w=E[t-1].F;
  vector<ll>DP(N,1e18);
  DP[0]=0;
  vector<vector<ll>>e(N);
  REP(i,M)if(E[i].F>=w){
    e[E[i].S.F].emplace_back(E[i].S.S);
    e[E[i].S.S].emplace_back(E[i].S.F);
  }
  queue<ll>Q;Q.emplace(0);
  while(sz(Q)){
    ll v=Q.front();Q.pop();
    for(auto u:e[v])if(chmin(DP[u],DP[v]+1))Q.emplace(u);
  }
  cout<<w<<" "<<DP[N-1]<<endl;
  return 0;
}