Given a $2$D integer array nums, return a list of all integers that appear in every array inside nums. The resulting list must be sorted in ascending order.

Constraints:

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

• $1 \leq$ sum(nums[i].length) $\leq 1000$

• $1 \leq$ nums[i][j] $\leq 1000$

• All the values of nums[i] are unique.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.