#include <iostream> #include <algorithm> #include <vector> using namespace std; int s[100086]; bool cmp(int a, int b) { return a>b; } int main() { int n,m; cin>>n>>m; for(int i=0;i<n;++i) { cin>>s[i]; } sort(s+0,s+n,cmp); int t=s[m-1]; int b=0; for(int i=0;i<n;++i) { if(s[i]>=t) { b++; }else{ break; } } cout<<t<<" "<<b<<endl; return 0; }