Given number **M** and **N** intervals in the form **[a, b]** (inclusive) where for every interval **-M <= a <= b <= M**, create a program that returns a point where the maximum number of intervals overlap.\n\nExample:\n* **M:** 10\n* **N:** 4\n* Intervals:\n\t* `[-3, 5]`\n\t* `[0, 2]`\n\t* `[8, 10]`\n\t* `[6, 7]`\n\nA correct answer would be either `0` ,`1` or `2` since those points are found where 2 intervals overlap and 2 is the maximum number of overlapping intervals.

Given number M and N intervals in the form [a, b] (inclusive) where for every interval -M <= a <= b <= M, create a program that returns a point where the maximu