#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n,k,p[50],t[50],c[50];
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>p[i]>>t[i];
c[p[i]]=t[i];
}
sort(p,p+n);
reverse(p,p+n);
for(int i=0;i<n;i++){
if(p[i]==p[i+1]){
if(c[p[i]]<c[p[i+1]])
swap(p[i],p[i+1]);
}
}
int x=p[k-1];
int y=c[p[k-1]];
int count=0;
for(int i=0;i<n;i++){
if(p[i]==x&&c[p[i]]==y)
count++;
}
cout<<count;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwogCmludCBtYWluKCkgewogICAgaW50IG4sayxwWzUwXSx0WzUwXSxjWzUwXTsKICAgIGNpbj4+bj4+azsKICAgIGZvcihpbnQgaT0wO2k8bjtpKyspewogICAgICAgIGNpbj4+cFtpXT4+dFtpXTsKICAgICAgICBjW3BbaV1dPXRbaV07CiAgICB9CiAgICBzb3J0KHAscCtuKTsKICAgIHJldmVyc2UocCxwK24pOwogICAgZm9yKGludCBpPTA7aTxuO2krKyl7CiAgICAgICAgaWYocFtpXT09cFtpKzFdKXsKICAgICAgICAgICAgaWYoY1twW2ldXTxjW3BbaSsxXV0pCiAgICAgICAgICAgICAgICBzd2FwKHBbaV0scFtpKzFdKTsKICAgICAgICB9CiAgICB9CiAgICBpbnQgeD1wW2stMV07CiAgICBpbnQgeT1jW3Bbay0xXV07CiAgICBpbnQgY291bnQ9MDsKICAgIGZvcihpbnQgaT0wO2k8bjtpKyspewogICAgICAgIGlmKHBbaV09PXgmJmNbcFtpXV09PXkpCiAgICAgICAgICAgIGNvdW50Kys7CiAgICB9CiAgICBjb3V0PDxjb3VudDsKIAogICAgcmV0dXJuIDA7Cn0=