#pragma GCC optimize("O3") #include using namespace std; using ll=long long; using P=pair; template using V=vector; #define fi first #define se second #define all(v) (v).begin(),(v).end() const ll inf=(1e18); //const ll mod=998244353; const ll mod=1000000007; const vector dy={-1,0,1,0},dx={0,-1,0,1}; ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;} ll LCM(ll c,ll d){return c/GCD(c,d)*d;} struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout< bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } templatevoid debag(const vector &a){cerr<<"debag :";for(auto v:a)cerr<void print(const vector &a){for(auto v:a)cout<>n>>m>>k; V> g(n); for(int i=0;i>a>>b>>c; --a;--b; g[a].emplace_back(b,c); g[b].emplace_back(a,c); } auto f=[&](ll mid)->int{ deque

deq; V dp(n,n+5); dp[0]=0; deq.emplace_back(0,0); while(deq.size()){ auto [v,cur]=deq.front(); deq.pop_front(); if(dp[cur]=mid&&chmin(dp[e.to],dp[cur]+1)){ deq.emplace_back(dp[e.to],e.to); } } } return dp[n-1]; }; ll l=0,r=200005; while(r-l>1){ ll mid=(l+r)/2; if(f(mid)>=k)l=mid; else r=mid; } cout<