include <bits/stdc++.h>

using namespace std;
bool sx(pair<int,int> a, pair<int,int> b){
if (a.first==b.first) {
return a.second>b.second;
}
return a.first>b.first;
}
int main(){
long long n;cin>>n;
long long k;cin>>k;
vector<pair\<int,int>> s(n);
for(int i=0;i<n;i++){ int a,b; cin>>a>>b;
s[i].first=a;
s[i].second=i+1;
}
sort(s.begin(),s.end(),sx);
cout<<s[k-1].first<<" "<<s[k-1].second<<endl;
return 0;
}