You’re given a group of individuals where everyone has a specific amount of money and a different level of quietness. Additionally, you’re given an array richer = $[x_{i}, y_{i}​]$, so that $x_{i}$​ has more money than $y_{i}$​. The quietness level of each individual is represented using an array named quiet.

Return an integer array res, where res[i] = y. If y has the lowest value in quiet[y] among all individuals, who have equal or more money than the individual i.

Constraints:

• $n =$ ...