#include<iostream>
#include <bits/stdc++.h>

#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

ll solve1(vector<pair<ll, ll> > v, ll L) {
    ll last = -1, cnt = 0;
    ll max_r = -1;
    reverse(v.begin(), v.end());
    while (!v.empty() && max_r != L) {
        while (!v.empty() && v.back().first <= last + 1) {
            max_r = max(max_r, v.back().second);
            v.pop_back();
        }
        assert(max_r > last);
        last = max_r;
        cnt++;
    }

    return cnt;
}

void doWork() {
    ll n, L;
    cin >> n >> L;
    L--;
    vector<ll> values = {0, L};
    vector<pair<ll, ll> > v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i].first >> v[i].second;
        values.push_back(v[i].first);
        values.push_back(v[i].second - 1);
    }
    sort(values.begin(), values.end());
    values.resize(unique(values.begin(), values.end()) - values.begin());
    for (int i = 0; i < n; i++) {
        v[i].first = lower_bound(values.begin(), values.end(), v[i].first) - values.begin();
        v[i].second = lower_bound(values.begin(), values.end(), v[i].second - 1) - values.begin();
    }
    L = (int) values.size() - 1;

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

    vector<int> freq(L + 2, 0);
    for (auto i: v) {
        freq[i.first]++;
        freq[i.second + 1]--;
    }
    ll ans = 0;

    for (int i = 0; i <= L; i++) {
        if (i)freq[i] += freq[i - 1];
        ans = max(ans, n - freq[i] + 1);
    }
    cout << solve1(v, L) << " " << ans;
}

int main() {
    IO
    int t = 1;
    // cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}