You are given a 2D integer array, intervals, where each element intervals[i] = $[left_i, \space right_i]$ represents the $i^{th}$ interval on the number line. Each interval includes all integers from $left_i$ to $right_i$, inclusive. The size (length) of an interval $[left_i, \space right_i]$ is defined as $\text{size} = right_i - left_i + 1$.

You are also given an integer array, queries. For each query value queries[j], you must find the smallest-sized interval $[left_i, \space right_i]$ ...