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

pair<int, vector<int>> complaint(int N, vector<int> L, vector<int> R){
	vector<int> pfx(N + 1, 0);
	int M = L.size();

	for (int i = 0; i < M; i++){
		pfx[L[i]]++;
		pfx[R[i] + 1]--;
	}

	for (int i = 1; i <= N; i++) pfx[i] += pfx[i-1];
	for (int i = 0; i <= N; i++) pfx[i] = M + 1 - pfx[i];

	int mn = M + 2;
	vector<int> res;

	for (int i = 0; i < N; i++){
		if (pfx[i] < mn){
			res.clear();
			mn = pfx[i];
		}
		if (pfx[i] == mn) res.push_back(i);
	}

	return {mn, res};
}