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

template <typename T> using max_heap = priority_queue<T>;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int N;
    int64_t C;
    cin >> N >> C;
    vector<pair<int64_t,int64_t>> segs(N);
    for (auto &[l, r]: segs) {
        cin >> l >> r;
    }
    sort(segs.begin(), segs.end());

    int ans1 = 0;
    int ans2 = 0;
    {
        int64_t curl = 0;
        int it = 0;
        max_heap<int64_t> pq;
        while (curl < C) {
            while (it < segs.size() && segs[it].first <= curl) {
                int64_t r = segs[it++].second;
                pq.emplace(r);
            }
            assert (pq.top() > curl);
            curl = pq.top();
            ++ans1;
            pq.pop();
        }
    }

    {
        vector<int64_t> L, R;
        vector<int64_t> u;
        for (auto [l, r]: segs) {
            L.emplace_back(r);
            R.emplace_back(l);
            if (l > 0)
                u.emplace_back(l - 1);
            u.emplace_back(l);
            u.emplace_back(r - 1);
            if (r < C)
                u.emplace_back(r);
        }
        sort(L.begin(), L.end());
        sort(R.begin(), R.end());

        for (int64_t x: u) {
            int le = lower_bound(L.begin(), L.end(), x) - L.begin();
            int ri = R.end() - upper_bound(R.begin(), R.end(), x);
            // cerr << le << '+' << ri << endl;
            ans2 = max(ans2, le + ri);
        }
    }
    ++ans2;
    cout << ans1 << ' ' << ans2 << '\n';
}