#include <bits/stdc++.h>
using namespace std;

// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;

double dp[1001001][20]; // 集合sまで配達済みで、最後にvに訪れた時の最短時間

signed main()
{
  cin.tie( 0 ); ios::sync_with_stdio( false );
  
  ll sx,sy; cin>>sx>>sy;
  ll n; cin>>n;
  
  vector<pair<pll,double>> t(n+1);
  double Weight=0;
  t[0]={{sx,sy},0};
  rep(i,n){
    ll x,y; double w; cin>>x>>y>>w;
    t[i+1]={{x,y},w};
    Weight+=w;
  }
  
  rep(i,1<<(n+1)) rep(j,n+1) dp[i][j]=INF;
  dp[0][0]=0;
  
  rep(s,1<<(n+1)){
    double W=Weight;
    rep(i,n+1) if((s>>i&1)) W-=t[i].second;
    // i to j
    rep(i,n+1) rep(j,n+1) if(i!=j && (s>>j&1)==0){
      ll x=t[i].first.first, y=t[i].first.second;
      ll nx=t[j].first.first, ny=t[j].first.second;
      ll d=abs(x-nx)+abs(y-ny);
      
      double cost=(W+100)/120*d+t[j].second;
      
      chmin(dp[s|(1<<j)][j],dp[s][i]+cost);
    }
  }
  
  double ans=dp[(1<<(n+1))-1][0];
  cout<<std::setprecision(10)<<ans<<endl;
  
}