Given a list of closed intervals, each interval is in the range of 1 to 200, and can overlap with other intervals. Return the minimum number of intervals to delete from the list, such that every integer from 1 to 200 is covered by at most 3 intervals.

Further question: what if we have millions of intervals?