#include <bits/stdc++.h>
using namespace std;
long long x, y, n, m, t, k, xx, yy, a[100100], b[100100], c[100100];
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  for (int i = 0; i < n; i++) {
    if (i && a[i] == a[i - 1]) {
      c[t - 1]++;
      continue;
    }
    b[t++] = a[i];
    c[t - 1] = 1;
  }
  swap(n, t);
  for (int i = 0; i < n; i++) {
    if (k - t * c[i] <= 0) {
      cout << b[i] << ' ';
      for (int j = 0; j < n; j++) {
        if (k - c[i] * c[j] <= 0) {
          return cout << b[j], 0;
        }
        k -= c[i] * c[j];
      }
    } else
      k -= t * c[i];
  }
  return 0;
}
