#include<bits/stdc++.h>
using namespace std;
#define N 100005
#define F(i,l,r) for(int i=(l);i<=(r);++i)
#define D(i,r,l) for(int i=(r);i>=(l);--i)
#define MEM(x,a) memset(x,a,sizeof(x))
int I() {char c=getchar(); int x=0; int f=1; while(c<'0' or c>'9') f=(c=='-')?-1:1,c=getchar(); while(c>='0' and c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar(); return ((f==1)?x:-x);}
#define re  double
#define eps 1e-8
#define vi vector<int>
#define pb push_back
#define pii pair<int,int>
#define vpii vector<pii>
#define fi first
#define se second
#define sz(x) ((int)x.size())
#define al(x) x.begin(),x.end()

int n,k; struct nd{int p,v;}a[N]; bool operator<(nd a,nd b){return a.p<b.p or (a.p==b.p and a.v<b.v);}
re b[N]; re d[N]; int bb[N];
int t[N],f[N];
void ad(int p,int x){for(int i=p;i<=n;i+=(i&(-i)))t[i]=max(t[i],x);}
int qr(int p){int s=0;for(int i=p;i;i-=(i&(-i)))s=max(s,t[i]);return s;}
bool cxk(re ti)
{
    F(i,1,n)b[i]=a[i].p+ti*a[i].v;
    F(i,1,n)d[i]=b[i];sort(d+1,d+n+1);
    F(i,1,n)bb[i]=lower_bound(d+1,d+n+1,b[i])-d;
    F(i,0,n) t[i]=0;
    F(i,1,n) f[i]=qr(bb[i]-1)+1,ad(bb[i],f[i]);
    
    int ans=0;F(i,1,n)ans=max(ans,f[i]);
    return ans>=n-k;
}
void flandre()
{
    n=I(),k=I();
    F(i,1,n)a[i]={I(),I()};
    sort(a+1,a+n+1);

    re l=0,r=3e9;
    while(r-l>=0.00001)
    {
        re mid=(l+r)/2.0;
        if(cxk(mid))l=mid;
        else r=mid;
    }
    // printf("%.3lf\n",l);
    if(l>2e9) puts("Forever");
    else printf("%.4lf\n",l);
}
int main()
{
    int t=1;
    while(t-->0){flandre();}
    return 0;
}