#include<bits/stdc++.h>
using namespace std;
#define re register
#define rep(i,a,b) for(ll i(a);i<=b;++i)
#define per(i,a,b) for(ll i(a);i>=b;--i)
#define ll long long
#define swap(x,y) x^=y^=x^=y
#define y1 yyy1
#define int ll
#define double long double
struct node {
	int p, v;
} a[100005];
int n, k;
int dp[100005];
double pos[100005], low[100005];
bool ck(double x) {
	rep(i, 1, n) pos[i] = a[i].p + a[i].v * x;
	memset(dp, 0, sizeof dp);
	int mx = 0;
	low[0] = -9e18;
	rep(i, 1, n) {
		dp[i] = upper_bound(low, low + mx + 1, pos[i] - 1e-7) - low;
		if (dp[i] > mx) {
			mx = dp[i];
			low[mx] = pos[i];
		} else low[dp[i]] = min(low[dp[i]], pos[i]);
	}
	return mx + k >= n;
}
bool cmp(node x, node y) {
	if (x.p == y.p) return x.v > y.v;
	else return x.p < y.p;
}
signed main() {
	ios::sync_with_stdio(0);
	cin >> n >> k;
	rep(i, 1, n) cin >> a[i].p >> a[i].v;
	sort(a + 1, a + n + 1, cmp);
	int t = 1;
	rep(i, 2, n) {
		if (a[i].p == a[t].p && a[i].v == a[t].v) k--;
		else a[++t] = a[i];
	}
	n = t;
	double l = 0, r = 2.5e9;
	while (l + 1e-7 < r) {
		double mid = (l + r) / 2;
		if (ck(mid)) l = mid;
		else r = mid;
	}
	double ans = (l + r) / 2;
	if (ans > 2.4e9) puts("Forever");
	else printf("%.6Lf", ans);
	return 0;
}