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

using ii = pair<int, int>;

pair<int, vector<int>> complaint(int N, vector<int> L, vector<int> R){
	int M = L.size();
	vector<ii> segments(M);
	for (int i = 0; i < M; i++) segments[i] = {L[i], R[i]};

	vector<int> pfx(N), sfx(N);

	sort(segments.begin(), segments.end(), [&](ii p1, ii p2){
		return p1.second < p2.second;
	});

	for (int i = 0, it = 0; i < N; i++){
		int lst = -1, cnt = 0;
		while (it < M && segments[it].second == i){
			if (lst < segments[it].first){
				lst = segments[it].second;
				cnt++;
			}
			it++;
		}
		pfx[i] = cnt;
	}

	sort(segments.begin(), segments.end(), [&](ii p1, ii p2){
		return p1.first > p2.first;
	});

	for (int i = N - 1, it = 0; i >= 0; i--){
		int lst = N, cnt = 0;
		while (it < M && segments[it].first == i){
			if (lst > segments[it].second){
				lst = segments[it].first;
				cnt++;
			}
			it++;
		}
		sfx[i] = cnt;
	}

	int k = pfx[N - 1];
	vector<int> res;

	for (int i = 0; i < N; i++){
		int lhs = (i == 0) ? 0 : pfx[i - 1];
		int rhs = (i == N-1) ? 0 : sfx[i + 1];
		if (lhs + rhs + 1 == k) res.push_back(i);
	}

	return {k, res};
}