#include <bits/stdc++.h>
using namespace std;
template <class T1>
void deb(T1 e1) {
  cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
  cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
  cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
       << endl;
}
map<long long int, long long int> Map;
map<long long int, long long int>::iterator it;
int main() {
  long long int n, q, i, j, k, l, arr[100000 + 10], d, r, a, b;
  while (cin >> n >> k) {
    Map.clear();
    for (i = 1; i <= n; i++) {
      cin >> arr[i];
      if (Map.find(arr[i]) == Map.end())
        Map[arr[i]] = 1ll;
      else
        Map[arr[i]]++;
    }
    long long int fndA = 0, aCnt, bCnt, cnt = 0;
    for (it = Map.begin(); it != Map.end(); it++) {
      fndA += (it->second) * n;
      if (fndA >= k) {
        a = it->first;
        break;
      }
      cnt += it->second;
    }
    long long int fndB = cnt * n;
    for (it = Map.begin(); it != Map.end(); it++) {
      fndB += (it->second) * (Map[a]);
      if (fndB >= k) {
        b = it->first;
        break;
      }
    }
    cout << a << " " << b << endl;
  }
  return 0;
}
