#include <bits/stdc++.h>
using namespace std;
const long long MAX = 100005, INF = 1 << 30;
long long a[MAX], b[MAX];
map<long long, long long> preCnt, backCnt;
map<long long, long long> mymap;
int main() {
  long long n, l = 0;
  long long k;
  cin >> n >> k;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    if (mymap.count(a[i]) == 0) {
      mymap[a[i]] = 1;
      b[l++] = a[i];
    } else
      ++mymap[a[i]];
  }
  sort(a, a + n, less<long long>());
  sort(b, b + l, less<long long>());
  for (long long i = 0; i < l; i++) {
    if (i == 0)
      preCnt[b[i]] = 0;
    else
      preCnt[b[i]] = preCnt[b[i - 1]] + mymap[b[i - 1]];
  }
  for (long long i = l - 1; i >= 0; i--) {
    if (i == l - 1)
      backCnt[b[i]] = 0;
    else
      backCnt[b[i]] = backCnt[b[i + 1]] + mymap[b[i + 1]];
  }
  long long already = 0;
  for (long long i = 0; i < l; i++) {
    long long pre = preCnt[b[i]] * mymap[b[i]];
    long long self = mymap[b[i]] * mymap[b[i]];
    long long back = backCnt[b[i]] * mymap[b[i]];
    if (already + pre + self + back < k)
      already += pre + self + back;
    else if (already + pre + self + back == k) {
      cout << b[i] << " " << a[n - 1] << endl;
      return 0;
    } else {
      if (already + pre >= k) {
        if (already + pre == k) {
          cout << b[i] << " " << b[i - 1] << endl;
          return 0;
        } else {
          for (long long j = 0; j < l; j++) {
            if (already + mymap[b[j]] * mymap[b[i]] < k)
              already += mymap[b[j]] * mymap[b[i]];
            else {
              cout << b[i] << " " << b[j] << endl;
              return 0;
            }
          }
        }
      } else if (already + pre + self >= k) {
        cout << b[i] << " " << b[i] << endl;
        return 0;
      } else {
        already += pre + self;
        for (long long j = i + 1; j < l; j++) {
          if (already + mymap[b[j]] * mymap[b[i]] < k)
            already += mymap[b[j]] * mymap[b[i]];
          else {
            cout << b[i] << " " << b[j] << endl;
            return 0;
          }
        }
      }
    }
  }
  return 0;
}
