Python
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def intersection(self, nums: List[List[int]]) -> List[int]:
        res=[]
        for i in range(len(set(nums[0]))):
            x = 1
            for j in range(1,len(nums)):
                if nums[0][i] in nums[j]:
                    x += 1
            if x == len(nums):
                res.append(nums[0][i])
        return sorted(res)

```
['Python3']