#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>

#define double long double
using namespace std;

const int N = 1e5 + 10;
const double eps = 1e-8;



struct people {
    int p,v;
} f[N];
double g[N];

int n,k;

bool cmp(people A,people B)
{
    return A.p < B.p;
}

bool check(double mid){
    int tmp = 0;
    for (int i = 1; i <= n; i ++ )
    {
        double t = f[i].p + f[i].v * mid;
        int k = lower_bound(g,g + tmp + 1,t - eps) - g;
        if(k > tmp || fabs(g[k]-t) > eps){
            g[k] = t;
           if(k > tmp)tmp++;
        }
    }
    return tmp + k >= n;
}




int main()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i ++ )
        cin >> f[i].p >> f[i].v;
    
    sort(f + 1,f + 1 + n, cmp);
    g[0] = -1e30;
    
    double l = 0,r = 2e9,mid;
    while(r - l > eps) {

        mid = (l + r)/2.0;
        if(check(mid)) l = mid;
        else r = mid;

    }

    if(fabs(r-2e9)<eps) return puts("Forever"),0;
    cout << fixed << setprecision(5) <<l<< endl;
}