#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int MAXN = 55;
long long pow_mod(long long a, long long b) {
long long res = 1;
a %= MOD;
while (b) {
if (b & 1) res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> L(N), R(N);
set<int> points;
points.insert(0);
points.insert(100);
for (int i = 0; i < N; i++) {
cin >> L[i] >> R[i];
points.insert(L[i]);
points.insert(R[i]);
}
vector<int> breaks(points.begin(), points.end());
sort(breaks.begin(), breaks.end());
}
