#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    ll L; cin >> L;
    vector<pair<ll,ll>> v(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i].first >> v[i].second;
    }
    sort(v.begin(), v.end());
    int r1 = 0;
    {
        ll cur = 0;
        priority_queue<ll> pq;
        for (int i = 0; cur < L;) {
            while(i < n and v[i].first <= cur){
                pq.push(v[i].second); i++;
            }
            ll p = pq.top(); pq.pop();
            r1++;
            cur = p;
        }
    }
    int r2 = 0;
    {
        ll cur = 0;
        priority_queue<ll,vector<ll>,greater<ll>> pq;
        for (int i = 0; cur < L;) {
            while(i < n and v[i].first <= cur){
                pq.push(v[i].second); i++;
            }
            ll p = pq.top(); pq.pop();
            r2++;
            cur = max(cur, p);
            if(cur == L) r2 += n-i;
        }
    }
    cout << r1 << " " << r2 << endl;
}