Python3 one line solution
\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        return sorted(reduce(lambda x,y: set(x) & set(y),nums))\n\nYou don\'
```\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        return sorted(reduce(lambda x,y: set(x) & set(y),nums))\n```\nYou don\'t have to use Counter , just set and reduce.\nIt\'s easier than Counter.
['Ordered Set', 'Python3']