{
let fulloverlaps = 0;
for (const pair of cleaning) {
if (pair.length < 2) continue;
const r1 = pair[0].split("-").map((n) => +n);
const r2 = pair[1].split("-").map((n) => +n);
if (fullycontains(r1, r2) || fullycontains(r2, r1)) fulloverlaps++;
}
return fulloverlaps;
}