[python] Using Counter, faster than 93%
\nclass Solution(object):\n    def intersection(self, nums):\n        """\n        :type nums: List[List[int]]\n        :rtype: List[int]\n        """\n        
```\nclass Solution(object):\n    def intersection(self, nums):\n        """\n        :type nums: List[List[int]]\n        :rtype: List[int]\n        """\n        length=len(nums)\n        all_nums=[]\n        ans=[]\n        for num in nums:\n            all_nums+=num\n        from collections import Counter\n        counts=Counter(all_nums)\n        for k in counts.keys():\n            if counts[k]==length:\n                ans.append(k)\n        return sorted(ans)\n```
['Python']