#include <bits/stdc++.h>
using namespace std;
int compare(const void* a, const void* b) { return (*(int*)a - *(int*)b); }
int main() {
  long long n;
  long long k, sum2, sum3;
  int a[100005], c[100005];
  long long b[100005];
  long long i, j, count;
  cin >> n;
  cin >> k;
  for (i = 0; i < n; i++) scanf("%d", &a[i]);
  sort(a, a + n);
  count = 0;
  for (i = 0; i < n; i++) {
    j = i;
    while (a[j] == a[i] && j < n) j++;
    b[count] = j - i;
    c[count] = a[i];
    count++;
    i = j - 1;
  }
  sum2 = 0;
  for (i = 0; i < count; i++) {
    if ((sum2 + b[i] * n) >= k) {
      sum3 = 0;
      for (j = 0; j < count; j++) {
        sum3 += (b[i] * b[j]);
        if (sum2 + sum3 >= k) {
          printf("%d %d", c[i], c[j]);
          return 0;
        }
      }
    } else
      sum2 += (b[i] * n);
  }
  return 0;
}
