#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
template<class A, class B> ostream& operator <<(ostream& out, const pair<A, B> &p) {
    return out << "(" << p.first << ", " << p.second << ")";
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const multiset<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template<class T> inline void YES(T condition) { 
    if(condition) cout << "YES" << endl;
    else cout << "NO" << endl;
}
template<class T> inline void Yes(T condition) {
    if(condition) cout << "Yes" << endl;
    else cout << "No" << endl;
}
template<class T> T gcd(T a, T b) {
    if(a && b) { return gcd(min(a, b), max(a, b) % min(a, b)); }
    else { return a; }
}
template<class T> T lcm(T a, T b){
    return a / gcd(a, b) * b;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);


    int n;
    LL k;
    cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    vector<int> neg;
    vector<int> pos;
    LL zcnt = 0;
    for (auto& v: a) {
        if (v < 0) neg.push_back(v);
        else if (v == 0) zcnt++;
        else pos.push_back(v);
    }
    sort(neg.begin(), neg.end());
    sort(pos.begin(), pos.end());
    int nsize = (int)neg.size();
    int psize = (int)pos.size();
    LL negcnt = 1LL * nsize * psize;
    LL zeros = 1LL * zcnt * (n - zcnt) + 1LL * zcnt * (zcnt - 1) / 2;
    
    // cout << neg << endl;
    // cout << pos << endl;
    // cout << "negcnt:" << negcnt << endl;
    // cout << "zeros:" << zeros << endl;

    auto negRank = [&](LL x) {
        LL res = 0;
        for (auto& ne: neg) {
            LL y = x / ne;
            if (y > 1e9) continue;
            int z = (int)y;
            res += (int)(pos.end() - upper_bound(pos.begin(), pos.end(), z));
        }
        return res;
    };

    auto posRank = [&](LL x) {
        LL res = 0;
        for (auto it = neg.begin(); it != neg.end(); it++) {
            int ne = *it;
            LL y = (x - ne - 1) / ne;
            if (y < -1e9) {res += it - neg.begin(); continue;}
            int z = (int)y;
            int cnts = (int)(it - upper_bound(neg.begin(), it, z));
            res += cnts;
            // cout << "      " << x << " " << y <<":" << res << endl;
        }
        // cout << x << "--" << res << endl;
        for (auto it = pos.begin(); it != pos.end(); it++) {
            int po = *it;
            LL y = (x + po - 1) / po;
            if (y > 1e9) {res += it - pos.begin(); continue;}
            int z = (int)y;
            res += (int)(lower_bound(pos.begin(), it, z) - pos.begin());
            // cout << "      " << x << " " << y <<":" << res << endl;
        }
        // cout << x << "++" << res << endl;
        return res;
    };

    auto Rank = [&] (LL x) {
        LL rk;
        if (x < 0) rk = negRank(x);
        else if (x == 0) rk = negcnt;
        else rk = negcnt + zeros + posRank(x);
        // cout << x << ":" << rk << endl;
        return rk;
    };

    LL l = -2e18, r = 2e18;
    while (l < r) {
        LL mid =  (l + r) >> 1;
        LL rk = Rank(mid);
        if (rk < k) l = mid + 1;
        else r = mid;
    }
    // for (int i = -16; i <= 16; i++) {
    //     cout << "num:" << i << "  rank:" << Rank(i) << endl;
    // }
    cout << l - 1 << '\n';

    return 0;
}


Measured memory_bytes: 2168