#include <bits/stdc++.h>
using namespace std;
int n, k;
double rec[100005];
struct node
{
    int p, v;
    bool operator<(const node t) const
    {
        return p == t.p ? v > t.v : p < t.p;
    }
} a[100005];

bool check(double x)
{
    int ans = 0;
    for (int i = 1; i <= n; i++)
    {
        double v = a[i].p + a[i].v * x;
        int pos = lower_bound(rec + 1, rec + ans + 1, v) - rec;
        rec[pos] = v, ans = max(ans, pos);
    }
    return n - ans <= k;
}

int main()
{
#ifndef ONLINE_JUDGE
    freopen("data.in", "r", stdin);
    // freopen("data.out", "w", stdout);
#endif
    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);
    double l = 0, r = 1e9;
    while (r - l > 1e-6)
    {
        double mid = (l + r) / 2.0;
        if (check(mid))
            l = mid;
        else
            r = mid;
    }
    if (l > 1e8)
        puts("Forever");
    else
        printf("%.2lf", l);
    return 0;
}