Minimum Days to Make Bouquets

You own a garden with `n` flowers. The `i`-th flower blooms on day `bloomDay[i]`. You want to make exactly `m` bouquets, and each bouquet requires `k` **adjacent** flowers (i.e., `k` consecutive blooming flowers in the array). Once a flower blooms, it stays bloomed forever. Write a function `min_days(bloomDay: List[int], m: int, k: int) -> int` that returns the **minimum** day on which you can make `m` bouquets. If it is impossible, return `-1`. Adjacent means flowers that are next to each other in the original array. You cannot reuse a flower in more than one bouquet. You may make bouquets from any contiguous block of `k` blooming flowers, and blocks do not overlap. Your solution must run in O(n log(max(bloomDay))) time.

>>> min_days([1,10,3,10,2], 3, 1)
3
>>> min_days([1,10,3,10,2], 3, 2)
-1
>>> min_days([7,7,7,7,12,7,7], 2, 3)
12