#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
const long double inf=INT_MAX;
typedef long double ldb;
const ldb eps=1e-7;
int n, k;ldb l, r=inf, mid;
struct pep{ldb pos, vel;
bool operator <(const pep& p) const
{return pos<p.pos;}}a[N];ldb b[N];
bool equal(const ldb& x, const ldb& y)
{return (x+eps>y)&&(x-eps<y);}
bool check(ldb t)
{int res=0;for(int i=1;i<=n;i++)
{ldb x=a[i].pos+a[i].vel*t;
if(!res||b[res]<x) b[++res]=x;
if(res&&equal(b[res],x)) continue;
int f=upper_bound(b+1,b+res+1,x)-b;
b[f]=x;}return res+k>=n;}
signed main(){
	cin>>n>>k;
	for(int i=1;i<=n;i++) cin>>a[i].pos>>a[i].vel;
	sort(a+1,a+n+1);
	while(l+eps<r)
	{mid=(l+r)/2.0;if(check(mid)) l=mid;else r=mid;}
	if(equal(inf,r)) puts("Forever");
	else printf("%.2Lf",l);
	return 0;
}