[Python] good looking solution, easy to understand
\n# Complexity\n- Time complexity: O(n^2)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(n^2)\n Add your space complexity here, e.g. O(n) 
\n# Complexity\n- Time complexity: O(n^2)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(n^2)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n\n        ll = []\n        sortedNums = sorted(nums)\n\n        for num in sortedNums[0]:\n            cou = 1\n\n            for listNums in sortedNums[1:]:\n                if num not in listNums:\n                    cou = 0\n                    break\n            \n            if cou:\n                ll.append(num)\n\n        return sorted(ll)\n```
['Python3']