simple  python solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        l=[]\n        for i in nums:\n            l.extend(i)\n        s=[]\n        k=len(nums)\n        for i in l:\n            if l.count(i)==k:\n                s.append(i)\n        s=list(set(s))\n        s.sort()\n        return s\n\n\n        \n```
['Python3']