#include<bits/stdc++.h>
using namespace std;
int ci=1;
struct dhq{
    int a,b,c;
};
bool cmp(dhq x,dhq y){
    return x.b<y.b;
}

dhq a[10000000];
int main(){
    int n,p;
    cin>>n>>p;
    for(int i=1;i<=n;i++){
        cin>>a[i].a>>a[i].b;
        a[i].c=i;
    }
    int sum=a[p].a;
    sort(a,a+n,cmp);
    for(int i=1;i<=n;i++){
     if(a[i].c!=p){
        if(a[i].a>=a[i].b&&sum>=a[i].b){
            sum+=a[i].a-a[i].b;
            ci++;
        }
    }
    }

    cout<<sum<<endl<<ci;
}

#include<iostream>
#include<algorithm>
using namespace std;
struct area{
    int spice;
    int cost;
};
bool cmp(area a,area b){
    return a.cost<b.cost;
}
area a[100010];
int main(){
    int n,p;
    cin>>n>>p;
    int sp_sum=0;
    int cnt=1;
    for(int i=1;i<=n;i++){
        cin>>a[i].spice>>a[i].cost;
        if(i==p){
            sp_sum+=a[i].spice;
            a[i].cost=100000;
        }
    }
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=n;i++){
        if(sp_sum>=a[i].cost && a[i].spice>=a[i].cost){
            sp_sum+=a[i].spice-a[i].cost;
            cnt++;
        }
    }
    cout<<sp_sum<<endl;
    cout<<cnt<<endl;
}