#include <iostream>
#include <algorithm>
using namespace std;
 
int main() {
    int n,k,p[51],t[51],c[51];
    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;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwogCmludCBtYWluKCkgewogICAgaW50IG4sayxwWzUxXSx0WzUxXSxjWzUxXTsKICAgIGNpbj4+bj4+azsKICAgIGZvcihpbnQgaT0wO2k8bjtpKyspewogICAgICAgIGNpbj4+cFtpXT4+dFtpXTsKICAgICAgICBjW3BbaV1dPXRbaV07CiAgICB9CiAgICBzb3J0KHAscCtuKTsKICAgIHJldmVyc2UocCxwK24pOwogICAgZm9yKGludCBpPTA7aTxuO2krKyl7CiAgICAgICAgaWYocFtpXT09cFtpKzFdKXsKICAgICAgICAgICAgaWYoY1twW2ldXTxjW3BbaSsxXV0pCiAgICAgICAgICAgICAgICBzd2FwKHBbaV0scFtpKzFdKTsKICAgICAgICB9CiAgICB9CiAgICBpbnQgeD1wW2stMV07CiAgICBpbnQgeT1jW3Bbay0xXV07CiAgICBpbnQgY291bnQ9MDsKICAgIGZvcihpbnQgaT0wO2k8bjtpKyspewogICAgICAgIGlmKHBbaV09PXgmJmNbcFtpXV09PXkpCiAgICAgICAgICAgIGNvdW50Kys7CiAgICB9CiAgICBjb3V0PDxjb3VudDsKIAogICAgcmV0dXJuIDA7Cn0=

NTAgMjIKNCA5CjggMQozIDcKMSAyCjMgOAo5IDgKOCA1CjIgMTAKNSA4CjEgMwoxIDgKMiAzCjcgOQoxMCAyCjkgOQo3IDMKOCA2CjEwIDYKNSA0CjggMQoxIDUKNiA4CjkgNQo5IDUKMyAyCjMgMwozIDgKNyA1CjQgNQo4IDEwCjggMgozIDUKMyAyCjEgMQo3IDIKMiA3CjYgOAoxMCA0CjcgNQoxIDcKNiA1CjMgMQo0IDkKMiAzCjMgNgo1IDgKNCAxMAoxMCA3CjcgMTAKOSA4

50 22
4 9
8 1
3 7
1 2
3 8
9 8
8 5
2 10
5 8
1 3
1 8
2 3
7 9
10 2
9 9
7 3
8 6
10 6
5 4
8 1
1 5
6 8
9 5
9 5
3 2
3 3
3 8
7 5
4 5
8 10
8 2
3 5
3 2
1 1
7 2
2 7
6 8
10 4
7 5
1 7
6 5
3 1
4 9
2 3
3 6
5 8
4 10
10 7
7 10
9 8