#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

bool sortByEndTime(const pair<int, int>& a, const pair<int, int>& b) {
    return a.second < b.second; // Sort by ending time (ri)
}

int max_tasks(int n, int k, vector<pair<int, int>>& tasks) {
    sort(tasks.begin(), tasks.end(), sortByEndTime); // Sort tasks by ending time (ri)

    int count = 0;
    int cur_time = 0;

    for (const auto& task : tasks) {
        int li = task.first;
        int ri = task.second;
        if (li >= cur_time) {
            count++;
            cur_time = ri;
        }
    }

    return count;
}

// 示例调用
int main() {
    int n, k;
    vector<pair<int, int>> tasks;
    cin >> n >> k;
    while (n--) {
        int x, y;
        cin >> x >> y;
        tasks.emplace_back(x, y);
    }
    cout << max_tasks(n, k, tasks) << endl;
    return 0;
}