#include <bits/stdc++.h>
#define V vector
#define L(i,j,k) for(int i=(j);i<=(k);i++)
#define R(i,j,k) for(int i=(j);i>=(k);i--)
#define all(x) x.begin(),x.end()
#define sz(a) ((int)a.size())
#define pb push_back
using namespace std;
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
bool cmp(pair<ll,ll> a,pair<ll,ll> b){
if(a.first==b.first)return a.second>b.second;
return a.first<b.first;
}
int main(){
int n,k;cin>>n>>k;
V<pair<ll,ll>>nu(n);
L(i,0,n-1){
cin>>nu[i].first>>nu[i].second;
}
sort(all(nu),cmp);
ordered_set<ll>s;
ll ans=0;
L(i,0,n-1){
s.insert(nu[i].second);
int m=sz(s);
if(m<k)continue;
auto it=s.find_by_order(m-k);
if(it==end(s)&&m==k)continue;
else if(it==end(s))it--;
ans=max(ans,*it-nu[i].first);
}
cout<<ans<<endl;
}
