#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
inline bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T>
inline bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll n, k;
  cin >> n >> k;
  vll a(n);
  rep(i, n){
    cin >> a[i];
  }
  sort(ALL(a));
  // mid以下がk個未満
  auto cond = [&](ll mid) -> bool{
    ll ret = 0;
    rep(i, n-1){
      if(a[i] > 0){
        // mid以下
        auto cond2 = [&](ll mid2) -> bool{
          return a[i]*a[mid2] <= mid;
        };
        auto BS2 = [&](ll true_max, ll false_min){
          while(false_min - true_max > 1){
            ll mid2 = true_max + ((false_min - true_max) / 2);
            (cond2(mid2) ? true_max : false_min) = mid2;
          }
          return false_min;
        };
        ll res = BS2(i, n);
        ret += max(res - i - 1, 0ll);
        dump(res, max(res - i - 1, 0ll));
      }else if(a[i] < 0){
        // mid超
        auto cond2 = [&](ll mid2) -> bool{
          return a[i]*a[mid2] > mid;
        };
        auto BS2 = [&](ll true_max, ll false_min){
          while(false_min - true_max > 1){
            ll mid2 = true_max + ((false_min - true_max) / 2);
            (cond2(mid2) ? true_max : false_min) = mid2;
          }
          return false_min;
        };
        ll res = BS2(i, n);
        ret += n - res;
        dump(n - res);
      }else{
        if(mid >= 0){
          ret += n - i - 1;
          dump(n - i - 1);
        }
      }
    }
    dump(ret, mid);
    return ret < k;
  };
  auto BS = [&](ll true_max, ll false_min){
    while(false_min - true_max > 1){
      ll mid = true_max + ((false_min - true_max) / 2);
      (cond(mid) ? true_max : false_min) = mid;
    }
    return false_min;
  };
  ll res = BS(-INF*2, INF*2);
  print(res);
}


Measured memory_bytes: 1792