Simple Python Code Beats 100% 🔥
```python3 []\nclass Solution:\n    from collections import defaultdict\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        counts = defaultdict(int)\n        i = 0\n        my_set = set()\n        while i < len(nums):\n            k = 0\n            for k in nums[i]:\n                counts[k] += 1\n            i += 1\n        for key, value in counts.items():\n            if value == len(nums):\n                my_set.add(key)\n        ans = sorted(my_set)\n        return ans\n\n\n        \n```
['Python3']