Given intervals [l,r] and queries, for each query q return the size (r-l+1) of the smallest interval containing q, or -1 if none. Input: JSON {intervals,queries}.
Input: JSON {intervals,queries}.
Output: Array of min sizes.
Input: {"intervals":[[1,4],[2,4],[3,6],[4,4]],"queries":[2,3,4,5]}
Output: [3,3,1,4]
Explanation: Smallest containing interval per query.Input: {"intervals":[[1,1]],"queries":[1]}
Output: [1]
Explanation: Single interval size 1.1<=intervals.length<=10^51<=queries.length<=10^5