include <bits/stdc++.h>

using namespace std;

define ll long long

bool sx(pair <ll,ll> a, pair<ll,ll> b){
if (a.first==b.first) return a.second>b.second;
else return a.first>b.first;
}

int main(){
ll n,m,x,y; cin>>n>>m;
vector < pair <ll,ll> > a(n);
for (int i=0;i<n;i++){ cin>>x>>y;
a[i].first=x;
a[i].second=y;
} sort (a.begin(),a.end(),sx);
cout<<a[m-1].first<<" "<<a[m-1].second;
}