#include<bits/stdc++.h>
using namespace std;
const int N=65;
const double eps=1e-6;
int n,k,x[N],y[N],c[N];
double dis(double x1,double y1,double x2,double y2){
	return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
int calc(double x1,double y1,double w){
	int num=0;
	for(int i=0;i<n;i++)
		if(dis(x1,y1,x[i],y[i])<=w/c[i]+eps)num++;
	return num;
}
bool work(double x1,double y1,double w1,double x2,double y2,double w2,double w){
	double a=dis(x1,y1,x2,y2);
	if(a>w1+w2+eps)return 0;
	double co=(a*a+w1*w1-w2*w2)/(2*a*w1),l=w1*co,x3=x1+(x2-x1)/a*l,y3=y1+(y2-y1)/a*l,
	h=sqrt(w1*w1-l*l),x4=x3-(y2-y1)/a*h,y4=y3+(x2-x1)/a*h,x5=2*x3-x4,y5=2*y3-y4;
	return calc(x4,y4,w)>=k||calc(x5,y5,w)>=k;
}
bool check(double w){
	for(int i=0;i<n;i++)if(calc(x[i],y[i],w)>=k)return 1;
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++)
			if(work(x[i],y[i],w/c[i],x[j],y[j],w/c[j],w))return 1;
	}
	return 0;
}
int main(){
	scanf("%d%d",&n,&k);
	for(int i=0;i<n;i++)scanf("%d%d%d",x+i,y+i,c+i);
	double l=0,r=1e6,mid;
	while(r-l>eps){
		mid=(l+r)/2;
		if(check(mid))r=mid;
		else l=mid;
	}
	printf("%.7lf",l);
	return 0;
} 
### Prompt

Your challenge is to write a Cpp solution to the following problem:

Takahashi wants to grill N pieces of meat on a grilling net, which can be seen as a two-dimensional plane. The coordinates of the i-th piece of meat are \left(x_i, y_i\right), and its hardness is c_i.

Takahashi can use one heat source to grill the meat. If he puts the heat source at coordinates \left(X, Y\right), where X and Y are real numbers, the i-th piece of meat will be ready to eat in c_i \times \sqrt{\left(X - x_i\right)^2 + \left(Y-y_i\right)^2} seconds.

Takahashi wants to eat K pieces of meat. Find the time required to have K or more pieces of meat ready if he put the heat source to minimize this time.

Constraints

* All values in input are integers.
* 1 \leq N \leq 60
* 1 \leq K \leq N
* -1000 \leq x_i , y_i \leq 1000
* \left(x_i, y_i\right) \neq \left(x_j, y_j\right) \left(i \neq j \right)
* 1 \leq c_i \leq 100

Input

Input is given from Standard Input in the following format:


N K
x_1 y_1 c_1
\vdots
x_N y_N c_N


Output

Print the answer.

It will be considered correct if its absolute or relative error from our answer is at most 10^{-6}.

Examples

Input

4 3
-1 0 3
0 0 3
1 0 2
1 1 40


Output

2.4


Input

10 5
-879 981 26
890 -406 81
512 859 97
362 -955 25
128 553 17
-885 763 2
449 310 57
-656 -204 11
-270 76 40
184 170 16


Output

7411.2252

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;
const int N=65;
const double eps=1e-6;
int n,k,x[N],y[N],c[N];
double dis(double x1,double y1,double x2,double y2){
	return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
int calc(double x1,double y1,double w){
	int num=0;
	for(int i=0;i<n;i++)
		if(dis(x1,y1,x[i],y[i])<=w/c[i]+eps)num++;
	return num;
}
bool work(double x1,double y1,double w1,double x2,double y2,double w2,double w){
	double a=dis(x1,y1,x2,y2);
	if(a>w1+w2+eps)return 0;
	double co=(a*a+w1*w1-w2*w2)/(2*a*w1),l=w1*co,x3=x1+(x2-x1)/a*l,y3=y1+(y2-y1)/a*l,
	h=sqrt(w1*w1-l*l),x4=x3-(y2-y1)/a*h,y4=y3+(x2-x1)/a*h,x5=2*x3-x4,y5=2*y3-y4;
	return calc(x4,y4,w)>=k||calc(x5,y5,w)>=k;
}
bool check(double w){
	for(int i=0;i<n;i++)if(calc(x[i],y[i],w)>=k)return 1;
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++)
			if(work(x[i],y[i],w/c[i],x[j],y[j],w/c[j],w))return 1;
	}
	return 0;
}
int main(){
	scanf("%d%d",&n,&k);
	for(int i=0;i<n;i++)scanf("%d%d%d",x+i,y+i,c+i);
	double l=0,r=1e6,mid;
	while(r-l>eps){
		mid=(l+r)/2;
		if(check(mid))r=mid;
		else l=mid;
	}
	printf("%.7lf",l);
	return 0;
} 
```