#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 3002 , MOD =  998244353 ; //1e9 + 7;

vector< pair<int ,int > > v;
int n ;

int32_t main() {

    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);

    ll l ;

    cin >> n >> l ;

    vector<ll> all ;
    pair<ll ,ll > a[n] ;
    v.resize(n) ;

    int y =0 ;

    int my =0 ,  my2 =0 ;

    for (int i = 0; i < n; ++i) {
        cin >> a[i].first >> a[i].second ;

        a[i].second-- ;

        all.push_back(a[i].first) , all.push_back( a[i].second ) ;
        all.push_back(a[i].second + 1) ;

        if( a[i].second + 1 != l && a[i].first  ) y++ ;

        if( a[i].first == 0 && a[i].second + 1 != l ) my++ ;

        if(a[i].first && a[i].second + 1 == l) my2++ ;
    }

    sort(all.begin() , all.end() ) ;
    all.erase(unique(all.begin() , all.end()) , all.end()) ;

    for (int i = 0; i < n; ++i) {
        v[i].first = lower_bound( all.begin() , all.end() , a[i].first ) - all.begin() ;
        v[i].second = lower_bound( all.begin() , all.end() , a[i].second ) - all.begin() ;
    }

    sort( v.begin() , v.end() ) ;

    int sz = (int)all.size() ;

    priority_queue<int> q ;

    vector<int> st[sz];
    for (int i = 0; i < n; ++i) {
        st[a[i].first].push_back(a[i].second) ;
    }

    int x =0  ,lst_c = -1 ;
    for(int i=0 ; i < sz-1 ; i++)
    {
        for(int e : st[i] ) q.push(e) ;

        if( lst_c < i )
        {
            lst_c = q.top() ;
            x++ ;
        }
    }

    cout << x << " " << y + max( my , my2 ) + 1 ;

    return 0;
}