Python fast solution
\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        if not nums:\n            return []\n        a = set(nums[0])\n     
```\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        if not nums:\n            return []\n        a = set(nums[0])\n        for i in nums[1:]:\n            a = a & set(i)\n        return sorted(a)\n```
['Ordered Set', 'Python']