Python Basic Solution
\n# Complexity\n- Time complexity:\nRun time =107 ms\nBeats = 76.56%\n\n- Space complexity:\nMemory =14.4 MB \nBeats = 6.15%\n\nUpvote if you find it helpful!!\
\n# Complexity\n- Time complexity:\nRun time =107 ms\nBeats = 76.56%\n\n- Space complexity:\nMemory =14.4 MB \nBeats = 6.15%\n\nUpvote if you find it helpful!!\n\n# Code\n```\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        i=0\n        common_list=[]\n        if len(nums)<=1:\n            common_list=nums[0]\n            return sorted(common_list)\n        else:\n            while i<len(nums)-1:\n            # for i in range(len(nums)):\n                for j in range(len(nums[i])):\n                    common_list = set(nums[i]).intersection(nums[i+1])\n                    nums[i+1]=common_list\n                i+=1\n                        # result = [i for i in a if i in b]\n            return sorted(common_list)\n\n                # print(nums[i][j])\n```
['Python3']