#include <cstdio>
#include <algorithm>
using namespace std;
struct ura{
    int nr,val;
    char c;
};
ura v[2001];
bool cmp(ura x,ura y){
    if (x.nr<y.nr)
        return true;
    else
        return false;
}
int main (){
    freopen ("patrate3.in","r",stdin);
    freopen ("patrate3.out","w",stdout);
    int maxx=0,n,h,i,x,ci,c=0,l=0;
    scanf ("%d %d",&n,&h);
    for (i=1;i<=n;i++){
        scanf ("%d %d",&v[i*2-1].nr,&x);
        v[i*2].nr=v[i*2-1].nr+x;
        v[i*2-1].c='s';
        v[i*2].c='d';
    }
    sort (v+1,v+2*n+1,cmp);
    for (i=1;i<=n*2;i++)
        if (v[i].c=='s')
            v[i].val=v[i-1].val+1;
        else
            v[i].val=v[i-1].val-1;
    for (i=1;i<=n*2;i++)
        if (v[i].val<h){
            if (l>maxx){
                maxx=l;
                ci=c;
            }
            c=l=0;
        }
        else{
            if (c==0)
                c=v[i].nr;
            l=l+v[i+1].nr-v[i].nr;
        }
    printf ("%d %d",ci,maxx);
    return 0;
}