You are given an array of intervals where each interval is represented by a pair $[start_i, end_i]$. The $start_i$ values are unique, meaning no two intervals begin at the same time.

The task is to find the right interval for each interval in the list. The right interval for an interval $i$ is an interval $j$ such that $start_j >= end_i$ and $start_j$ is minimized (i.e., it is the smallest start time among all valid intervals that is greater than or equal to $end_i$). Note that $i$ may equal $j$.

Return an array of right interval indexes for each interval $i$. If no right interval exists for interval $i$, then put $-1$ at index $i$.

Constraints:

• $1 \leq$ intervals.length $\leq 1000$

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

• $-10^6 \leq start_i \leq end_i \leq 10^6$

• The start times are guaranteed to be unique.