#include <bits/stdc++.h>
using namespace std;
void c_p_c() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i += 6) {
    if (n % i == 0 || n % (i + 2) == 0) return false;
  }
  return true;
}
vector<long long> Sieve(long long n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (long long i = 2; i * i <= n; i++) {
    if (prime[i]) {
      for (long long j = i * i; j <= n; j += i) {
        prime[j] = false;
      }
    }
  }
  vector<long long> primes;
  for (long long i = 2; i <= n; i++) {
    if (prime[i]) primes.push_back(i);
  }
  return primes;
}
set<long long> primeFactors(long long n) {
  set<long long> factors;
  while (n % 2 == 0) {
    n /= 2;
    factors.insert(2);
  }
  for (long long i = 3; i <= sqrt(n); i += 2) {
    while (n % i == 0) {
      factors.insert(i);
      n /= i;
    }
  }
  if (n > 2) factors.insert(n);
  return factors;
}
long long power(long long x, unsigned long long y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
bool cmp(pair<pair<long long, long long>, long long> a,
         pair<pair<long long, long long>, long long> b) {
  long long dista =
      (a.first.first * a.first.first) + (a.first.second * a.first.second);
  long long distb =
      (b.first.first * b.first.first) + (b.first.second * b.first.second);
  return dista < distb;
}
int32_t main() {
  c_p_c();
  long long n, p;
  cin >> n >> p;
  vector<pair<pair<long long, long long>, long long> > arr(n);
  long long sum = p;
  long long x, y, z;
  for (long long i = 0; i < n; i++) {
    cin >> x >> y >> z;
    arr[i] = make_pair(make_pair(x, y), z);
    sum += arr[i].second;
  }
  if (sum < 1000000)
    cout << -1 << '\n';
  else {
    sort(arr.begin(), arr.end(), cmp);
    long long r;
    for (long long i = 0; i < n; i++) {
      if (p >= 1000000) {
        break;
      }
      r = (arr[i].first.first * arr[i].first.first) +
          (arr[i].first.second * arr[i].first.second);
      p += arr[i].second;
    }
    cout << fixed << setprecision(8) << sqrt(r) << '\n';
  }
}
