#include <bits/stdc++.h>
using namespace std;
const long long inf = (long long)2e9;
int n;
long long a[100100];
inline long long solve1(long long x) {
  long long res = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] > x) {
      break;
    }
    res += n;
  }
  return res;
}
inline long long solve2(long long x, long long y) {
  int pos = -1;
  for (int i = 0; i < n; i++) {
    if (a[i] > y) {
      break;
    }
    pos = i;
  }
  long long res = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] == x) {
      res += pos + 1;
    }
  }
  return res;
}
int main() {
  long long k;
  scanf("%d %I64d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%I64d", &a[i]);
  }
  sort(a, a + n);
  long long aa, l = -inf, r = inf;
  while (l <= r) {
    long long mid = (l + r) / 2;
    if (solve1(mid) >= k) {
      aa = mid;
      r = mid - 1;
    } else {
      l = mid + 1;
    }
  }
  k -= solve1(aa - 1);
  long long bb;
  l = -inf;
  r = inf;
  while (l <= r) {
    long long mid = (l + r) / 2;
    if (solve2(aa, mid) >= k) {
      bb = mid;
      r = mid - 1;
    } else {
      l = mid + 1;
    }
  }
  printf("%I64d %I64d\n", aa, bb);
  return 0;
}
