Problem: Tokitsukaze and her friends are trying to infiltrate a secret base built by Claris. However, Claris has been aware of that and set a bomb which is going to explode in a minute. Although they try to escape, they have no place to go after they find that the door has been locked.

At this very moment, CJB, Father of Tokitsukaze comes. With his magical power given by Ereshkigal, the goddess of the underworld, CJB is able to set m barriers to protect them from the explosion. Formally, let's build a Cartesian coordinate system on the plane and assume the bomb is at O(0, 0). There are n persons in Tokitsukaze's crew, the i-th one of whom is at P_i(X_i, Y_i). Every barrier can be considered as a line with infinity length and they can intersect each other. For every person from Tokitsukaze's crew, there must be at least one barrier separating the bomb and him, which means the line between the bomb and him intersects with at least one barrier. In this definition, if there exists a person standing at the position of the bomb, any line through O(0, 0) will satisfy the requirement.

Although CJB is very powerful, he still wants his barriers to be as far from the bomb as possible, in order to conserve his energy. Please help him calculate the maximum distance between the bomb and the closest barrier while all of Tokitsukaze's crew are safe.

Input

The first line contains two integers n, m (1 ≤ n, m ≤ 10^5), indicating the number of people and the number of barriers respectively.

The i-th line of the next n lines contains two integers X_i, Y_i (-10^5 ≤ X_i, Y_i ≤ 10^5), indicating the i-th person's location P_i(X_i, Y_i). Note that P_i may have the same coordinates as P_j (j ≠ i) or even O.

Output

Print a single real number — the maximum distance meeting the requirement. Your answer is considered correct if its absolute or relative error does not exceed 10^{-6}.

Formally, let your answer be a, and the jury's answer be b. Your answer is accepted if and only if (|a - b|)/(max(1, |b|)) ≤ 10^{-6}.

Examples

Input


3 1
2 0
0 2
-1 0


Output


0.0000000000


Input


1 1
0 0


Output


0.0000000000


Input


2 1
-1 -1
-1 -1


Output


1.4142135617


Input


3 100000
3 2
-1 -3
2 -5


Output


3.1622776602

Note

In the first two examples, CJB must set the barrier crossing O(0, 0).

In the last two examples, CJB can set each barrier crossing some P_i such that the barrier is perpendicular to the line between P_i and O.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int NN = 101010;
pair<int, int> operator-(const pair<int, int> &a, const pair<int, int> &b) {
  return pair<int, int>(a.first - b.first, a.second - b.second);
}
pair<int, int> operator+(const pair<int, int> &a, const pair<int, int> &b) {
  return pair<int, int>(a.first + b.first, a.second + b.second);
}
long long operator^(const pair<int, int> &a, const pair<int, int> &b) {
  return (long long)a.first * b.second - (long long)a.second * b.first;
}
long long operator*(const pair<int, int> &a, const pair<int, int> &b) {
  return (long long)a.first * b.first + (long long)a.second * b.second;
}
pair<int, int> p[NN];
int sgn(const long long &a) { return (a > 0) - (a < 0); }
int pos(const pair<int, int> &a) {
  return a.second > 0 || a.second == 0 && a.first > 0;
}
const long double pi = acosl(-1.0), eps = 1e-9;
int n, m;
long double al[NN], ga[NN], len[NN];
long double tmp[NN * 2];
pair<int, int> q[NN], tp[NN];
int vst[NN], I[NN], flag;
long double get(long double first) {
  while (first < 0) first += 2 * pi;
  while (first >= 2 * pi) first -= 2 * pi;
  return first;
}
pair<int, int> a[NN << 3];
int c[NN << 3], mn[NN << 3], nxt[NN << 3][20];
int solve1(pair<int, int> *p, int n, int N, int m) {
  int nn = 0;
  for (int i = 0; i < n; i++) {
    if (p[i].second > N) a[nn++] = make_pair(p[i].first - N, p[i].second - N);
    a[nn++] = p[i];
    a[nn++] = make_pair(p[i].first + N, p[i].second + N);
    c[i] = p[i].second > N ? p[i].second - N : p[i].second;
  }
  sort(a, a + nn);
  sort(c, c + n);
  for (int i = nn - 1; i >= 0; i--) {
    mn[i] = a[i].second;
    if (i < nn - 1) mn[i] = min(mn[i], mn[i + 1]);
  }
  int now = 0;
  for (int i = 1; i <= N + N; i++) nxt[i][0] = 0;
  for (int i = 0; i < n; i++) {
    while (now < nn && a[now].first <= c[i]) now++;
    if (now == nn)
      nxt[c[i]][0] = c[0] + N;
    else
      nxt[c[i]][0] = mn[now];
  }
  for (int i = 0; i < n; i++) nxt[c[i] + N][0] = nxt[c[i]][0] + N;
  for (int i = 1; i < 20; i++) {
    for (int j = 1; j <= N + N; j++) {
      if (nxt[j][i - 1] > N + N)
        nxt[j][i] = nxt[j][i - 1];
      else
        nxt[j][i] = nxt[nxt[j][i - 1]][i - 1];
    }
  }
  for (int i = 0; i < n; i++) {
    int now = c[i], ok = 0;
    for (int u = m; u && !ok; u ^= u & -u) {
      int t = __builtin_ctz(u);
      if (nxt[now][t] >= c[i] + N)
        ok = 1;
      else
        now = nxt[now][t];
    }
    if (ok) return 1;
  }
  return 0;
}
bool solve(pair<int, int> *p, int n, int N, int m) {
  int nn = 0;
  sort(p, p + n);
  for (int i = 0; i < n; i++) {
    while (nn && p[nn - 1].first <= p[i].first &&
           p[nn - 1].second >= p[i].second)
      nn--;
    p[nn++] = p[i];
  }
  while (nn && p[nn - 1].second - N >= p[0].second) nn--;
  return solve1(p, nn, N, m);
}
long double a1[NN << 2], a2[NN << 2];
int can(long double r) {
  if (n <= m) return 1;
  int nn = 0;
  for (int i = 0; i < n; i++) {
    ga[i] = acosl(r / len[i]);
    a1[i] = tmp[nn++] = get(al[i] - ga[i]);
    a2[i] = tmp[nn++] = get(al[i] + ga[i]);
  }
  sort(tmp, tmp + nn);
  nn = unique(tmp, tmp + nn) - tmp;
  for (int i = 0; i < n; i++) {
    long double t1 = a1[i], t2 = a2[i];
    int u = lower_bound(tmp, tmp + nn, t1) - tmp + 1;
    int v = lower_bound(tmp, tmp + nn, t2) - tmp + 1;
    if (v < u) v += nn;
    q[i] = make_pair(u, v);
  }
  return solve(q, n, nn, m);
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) scanf("%d%d", &p[i].first, &p[i].second);
  for (int i = 0; i < n; i++)
    if (p[i].first == 0 && p[i].second == 0) return puts("0");
  sort(p, p + n);
  n = unique(p, p + n) - p;
  sort(p, p + n, [&](const pair<int, int> &a, const pair<int, int> &b) {
    int ta = pos(a), tb = pos(b);
    if (ta != tb) return ta > tb;
    ta = sgn(a ^ b);
    if (ta) return ta > 0;
    return a * a < b * b;
  });
  n = unique(p, p + n,
             [&](const pair<int, int> &a, const pair<int, int> &b) {
               int ta = pos(a), tb = pos(b);
               if (ta != tb) return false;
               return (a ^ b) == 0;
             }) -
      p;
  long double st = 0, ed = 1e6;
  for (int i = 0; i < n; i++) {
    al[i] = atan2l(p[i].second, p[i].first);
    ed = min(ed, len[i] = sqrtl(p[i] * p[i]));
  }
  for (int i = 0; i < 50; i++) {
    long double mid = (st + ed) / 2;
    if (can(mid))
      st = mid;
    else
      ed = mid;
  }
  cout << fixed << setprecision(20) << st << endl;
  return 0;
}