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

template<class T>
bool chmax(T& a, const T& b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>
bool chmin(T& a, const T& b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) is >> e;
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

using LL = long long;

#define fs first
#define sc second

const LL MOD = 1e9+7;

const double EPS = 1e-8;

using Point = complex<double>;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    int N, K; cin >> N >> K;

    vector<double> c(N);
    vector<Point> p(N);

    for (int i = 0; i < N; ++i) {
        double x, y;
        cin >> x >> y >> c[i];
        p[i] = {x, y};
    }

    auto check = [&](double t) {
        for (int i = 0; i < N; ++i) {
            for (int j = i+1; j < N; ++j) {
                double ri = t / c[i],
                       rj = t / c[j];

                double d = abs(p[i] - p[j]);

                double xi = p[i].real(), yi = p[i].imag(),
                       xj = p[j].real(), yj = p[j].imag();

                vector<Point> qs;
                if (ri + rj >= d) {
                    double A = -2*xi +2*xj,
                           B = -2*yi +2*yj,
                           C = (xi*xi + yi*yi - ri*ri) -
                               (xj*xj + yj*yj - rj*rj);
                    //DUMP(A);
                    //DUMP(B);
                    //DUMP(C);

                    double di = abs(A*xi + B*yi + C) / sqrt(A*A + B*B);
                    //DUMP(di);

                    double h = sqrt(ri*ri - di*di);
                    //DUMP(h);

                    Point n = (p[j]-p[i]) / abs(p[j]-p[i]);
                    qs.push_back(p[i] + di * n + h * polar(1.0, M_PI/2) * n);
                    qs.push_back(p[i] + di * n + h * polar(1.0,-M_PI/2) * n);
                }

                for (Point& q : qs) {
                    int count = 0;
                    for (int k = 0; k < N; ++k) {
                        if (abs(p[k] - q) - t/c[k] < EPS) {
                            ++count;
                        }
                    }
                    if (count >= K) {
                        return true;
                    }
                }

            }
        }
        for (int i = 0; i < N; ++i) {
            int count = 0;
            for (int k = 0; k < N; ++k) {
                if (abs(p[k] - p[i]) - t/c[k] < EPS) {
                    ++count;
                }
            }
            if (count >= K) {
                return true;
            }
        }
        return false;
    };

    double ng = 0, ok = 1e6;
    while (abs(ok - ng) > EPS) {
        double mid = (ng + ok) / 2;
        (check(mid) ? ok : ng) = mid;
    }

    cout << ok << endl;


    return 0;
}


Measured memory_bytes: 384