#include using namespace std; struct Precision{ Precision(){ cout<>n>>m>>k; int x,y; cin>>x>>y; x--;y--; for(int i=0;i ps(n),qs(n); for(int i=0;i>ps[i]>>qs[i]; vector> G(n); for(int i=0;i>u>>v; u--;v--; D d=hypot(ps[u]-ps[v],qs[u]-qs[v]); dist[u][v]=dist[v][u]=d; G[u].emplace_back(v); G[v].emplace_back(u); } struct Path{ vector vs; bool isvalid(int nxt){ if(dist[vs.back()][nxt]<0) return false; if(count(vs.begin(),vs.end(),nxt)) return false; return true; } D len; bool operator<(const Path &o)const{ if(len!=o.len) return len(const Path &o)const{ if(len!=o.len) return len>o.len; if(vs.size()!=o.vs.size()) return vs.size()>o.vs.size(); return vs>o.vs; }; }; priority_queue, greater> pq; vector> dp(n); auto push=[&](Path p){ if(dp[p.vs.back()].count(p)) return; dp[p.vs.back()].emplace(p); pq.emplace(p); }; { Path p; p.vs.emplace_back(x); p.len=0; push(p); } vector cnt(n,0); while(!pq.empty()){ Path p=pq.top();pq.pop(); int v=p.vs.back(); cnt[v]++; if(cnt[y]==k) break; if(cnt[v]>k*10) continue; for(int u:G[v]){ if(!p.isvalid(u)) continue; p.vs.emplace_back(u); p.len+=dist[v][u]; push(p); p.vs.pop_back(); p.len-=dist[v][u]; } } for(int i=0;ilen<