Python3
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        d = {}\n        \n        for i in range(len(nums)):\n            for j in nums[i]:\n                if j not in d:\n                    d[j] = 1\n                else:\n                    d[j]+=1\n                    \n        res = []\n        for k,v in d.items():\n            if v == len(nums):\n                res.append(k)\n                \n        return sorted(res)\n```
['Python3']