#include <iostream>
#include <algorithm>
using namespace std;
using i64 = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

struct point { int x, y; double w; };

const int inf = 987654321;
int n;
vector<point> ps;
vector<vector<double>> dp;

double calc_speed(int mask) {
  double weight = 0;
  for(int i : range(n)) {
    if(mask>>i & 1) {
      weight += ps[i].w;
    }
  }
  return 120. / (weight + 100);
}

int dist(point p, point q) {
  return abs(p.x - q.x) + abs(p.y - q.y);
}

int main(void) {
  int x0, y0; scanf("%d%d", &x0, &y0);
  scanf("%d", &n);
  n += 1;
  ps.resize(n);
  ps[0] = point({x0, y0, 0});
  for(int i : range(1, n)) {
    int x, y; double w; scanf("%d%d%lf", &x, &y, &w);
    ps[i] = point({x, y, w});
  }
  dp.resize(n, vector<double>(1<<n, inf));
  for(int v : range(n)) {
    dp[v][1] = dist(ps[v], ps[0]) / calc_speed(1);
  }
  for(int mask : range(1<<n)) {
    for(int v : range(n)) {
      for(int i : range(1, n)) {
        if(!(mask>>i & 1)) { continue; }
        int nmask = mask & ~(1<<i);
        dp[v][mask] = min(dp[v][mask], dp[i][nmask] + dist(ps[v], ps[i]) / calc_speed(mask) + ps[i].w);
      }
    }
  }
  double res = dp[0][(1<<n)-1];
  printf("%.9lf\n", res);
  return 0;
}