#include<bits/stdc++.h>
using namespace std;
const int N=5e4;
const long double ACC=1e-6;
int n,k,f[N+5],top,res;
long double pos[N+5],low[N+5],l=0,r=3e9,mid,ans;

struct node
{
 int v,p;
}a[N+5];

inline bool Cmp(const node &a,const node &b)
{
 if(a.p!=b.p)
 {
  return (a.p<b.p);
 }
 return (a.v<b.v);
}

bool Check(long double &x)
{
 for(int i=1;i<=n;++i)
 {
  low[i]=3e9;
  pos[i]=a[i].p+a[i].v*x;
 }
 res=1;
 low[1]=pos[1];
 for(int i=2;i<=n;++i)
 {
  if(low[res]<pos[i])
  {
   low[++res]=pos[i];
   continue;
  }
  low[upper_bound(low+1,low+res+1,pos[i])-low]=pos[i];
 }
 return (n-res<=k);
}

int main()
{
 scanf("%d%d",&n,&k);
 for(int i=1;i<=n;++i)
 {
  scanf("%d%d",&a[i].p,&a[i].v);
 }
 sort(a+1,a+n+1,Cmp);
 top=1;
 for(int i=2;i<=n;++i)
 {
  if(a[i].p==a[top].p&&a[i].v==a[top].v)
  {
   k--;
  }
  else
  {
   a[++top]=a[i];
  }
 }
 n=top;
 while(r-l>ACC)
 {
  mid=(l+r)/2;
  if(Check(mid))
  {
   l=ans=mid;
  }
  else
  {
   r=mid;
  }
 }
 if(ans>1e9)
 {
  printf("%s\n","Forever");
 }
 else
 {
  printf("%.4Lf",ans);
 }
 return 0;
}
/*
4 1
1 1
3 -1
5 2
7 -2
//
1.0000

4 2
1 1
3 -1
5 2
7 -2
//
Forever

5 0
2 3
233 -9
55 1
66 -2
1000 -10
//
3.6667
*/