#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
int main(){
    ll n,k;
    cin >> n >> k;
    vector<pair<ll,ll>> v(n);
    for(ll i=0;i < n;i++)
    {
        cin >> v.at(i).fi >> v.at(i).se;
    }//input

    ll no=0,yes=pow(10,9);

    while(abs(no-yes)>1){
        ll cnt=0,c=(no+yes)/2;//overflow
        for(ll i=0;i < n;i++)
        {   
            cnt+=min(c,v.at(i).se)-min(v.at(i).fi-1,c);

            if(cnt>=k){
                yes=c;
                break;
            }
        }
        if(cnt<k){
            no=c;
        }
        cout << no << ';' << yes << endl;
    }

    cout << yes << endl;
}
//queue 要素多すぎるとMLE