//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
//#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define inf 1e8
#define rg register
using namespace std;
const int N=1e5+10;
inline ll read(){
	register ll s=0,f=0;
	register char ch=getchar();
	while(!isdigit(ch)) f|=(ch=='-'),ch=getchar();
	while(isdigit(ch)) s=(s<<1)+(s<<3)+(ch^48),ch=getchar();
	return f?-s:s;
}
inline void write(ll x){
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
int n,k;
struct data{
	ll p,v;
}a[N];
struct qj{
	double l,r;
}b[N];
inline bool cmp(qj a,qj b){
	if(a.r==b.r)return a.l<b.l;
	return a.r<b.r;
}
inline bool check(double x){
	for(int i=1;i<=n;i++){
		if(a[i].v>=0)b[i]={a[i].p,a[i].p+x*a[i].v};
		else b[i]={a[i].p+x*a[i].v,a[i].p};
	}
	sort(b+1,b+1+n,cmp);
//	for(int i=1;i<=n;i++){
//		printf("l=%.5lf r=%.5lf\n",b[i].l,b[i].r);
//	}
	int cnt=1;
	double ls=b[1].r;
	for(int i=2;i<=n;i++){
		if(ls<b[i].l)cnt++,ls=b[i].r;
	}
//	printf("x=%.5lf ",x);
//	printf("%d\n",cnt);
	if(n-cnt<=k)return 1;
	return 0;
}
int main() {
//	freopen("in.txt","r",stdin);
//	freopen("out.txt","w",stdout);
	n=read(),k=read();
	for(int i=1;i<=n;i++)a[i].p=read(),a[i].v=read();
	double l=0,r=2e9,ans;
	while(r-l>=0.000000001){
		double mid=(l+r)/2;
		if(check(mid))ans=mid,l=mid;
		else r=mid;
	}
	if(ans>=2e9-0.000001)printf("Forever");
	else printf("%.4lf",ans);
	return 0;
}