Intersection of Multiple Arrays LeetCode solution in Python

1
class Solution:
2
    def intersection(self, A: List[List[int]]) -> List[int]:
3
        return sorted(
4
            [k for k, v in Counter([x for l in A for x in l]).items() if v == len(A)]
5
        )