Python3, Set Intersection
\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        return sorted(set.intersection(*[set(nums[i]) for i in range(len(num
```\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        return sorted(set.intersection(*[set(nums[i]) for i in range(len(nums))]))\n```\n\nExplanation:\n```\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        answ=set(nums[0])\n        for i in range(1,len(nums)):\n            answ=answ.intersection(set(nums[i]))\n        return sorted(answ)       \n```
[]