#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, k;
  cin >> n >> k;
  long long int arr[n];
  map<long long int, long long int> mp;
  vector<long long int> v;
  for (long long int i = 0; i < n; i++) {
    cin >> arr[i];
    mp[arr[i]]++;
    if (mp[arr[i]] == 1) v.push_back(arr[i]);
  }
  sort(v.begin(), v.end());
  long long int curr = 0;
  long long int i = 0;
  while (true) {
    long long int temp = curr + mp[v[i]] * n;
    if (temp >= k) {
      cout << v[i] << " ";
      long long int j = 0;
      while (true) {
        long long int ans = curr + mp[v[i]] * mp[v[j]];
        if (ans >= k) {
          cout << v[j] << endl;
          return 0;
        } else {
          j++;
          curr = ans;
        }
      }
    } else {
      curr = temp;
      i += 1;
    }
  }
  return 0;
}
