#include <bits/stdc++.h>
using namespace std;

using ll = long long;

void solve() {
    int n;
    ll L;
    cin >> n >> L;
    vector<ll> p;
    vector<pair<ll, ll>> e(n + 1);
    for (int i = 1; i <= n; i++) {
        ll l, r;
        cin >> l >> r;
        e[i] = make_pair(l, r);
    }
    sort(e.begin() + 1, e.end());
    ll now = 0;
    int cnt = 0, i = 1;
    while (now < L) {
        ll mx = now;
        for (; i <= n && e[i].first <= now; i++) {
            mx = max(mx, e[i].second);
        }
        now = mx, cnt++;
    }
    cout << cnt << ' ';
    for (int i = 1; i <= n; i++) {
        p.push_back(e[i].first);
        p.push_back(e[i].second);
    }
    sort(p.begin(), p.end());
    p.resize(unique(p.begin(), p.end()) - p.begin());
    vector<int> val(p.size(), 0);
    for (int i = 1; i <= n; i++) {
        int L = lower_bound(p.begin(), p.end(), e[i].first) - p.begin();
        int R = lower_bound(p.begin(), p.end(), e[i].second) - p.begin();
        val[L]++, val[R]--;
    }
    int Min = n;
    for (int i = 0; i < (int)p.size() - 1; i++) {
        if (i) val[i] += val[i - 1];
        Min = min(Min, val[i]);
    }
    cout << n - Min + 1 << '\n';
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}