You are given a 0-indexed 2D integer array, flowers, where each element flowers[i] $= [start_i, end_i]$ represents the time interval during which the $i^{th}$ flower is in full bloom (inclusive).

You are also given a 0-indexed integer array, people, of size $n$, where people[i] denotes the time at which the $i^{th}$ person arrives to view the flowers.

For each person, determine how many flowers are in full bloom at their arrival time. Return an integer array, ans, of length $n$, where ans[i] is the number of blooming flowers when the $i^{th}$ person arrives.

Constraints:

• 1 $\leq$ flowers.length $\leq$ $10^3$

• flowers[i].length $== 2$

• 1 $\leq$ $start_i$ $\leq$ $end_i$ $\leq$ $10^4$

• 1 $\leq$ people.length $\leq$ $10^3$

• 1 $\leq$ people[i] $\leq$ $10^4$