#include <bits/stdc++.h>
using namespace std;
int dblcmp(double x) { return fabs(x) < 1e-8 ? 0 : x > 0 ? 1 : -1; }
bool insize(int c, int l, int r) {
  if (c >= l && c <= r) return true;
  return false;
}
template <class T>
inline void checkmin(T &a, T b) {
  if (a == -1 || a > b) a = b;
}
template <class T>
inline void checkmax(T &a, T b) {
  if (a < b) a = b;
}
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
const int N = 100001;
const int E = 200002;
const int INF = 0x3f3f3f3f;
int n, k, a[100];
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  if (k > n) {
    puts("-1");
    return 0;
  }
  sort(a + 1, a + 1 + n);
  printf("%d 0\n", a[n - k + 1]);
}
