class Solution:
    def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]:
        import collections
        return list((collections.Counter(nums1) & collections.Counter(nums2)).elements())
class Solution:
    def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]:
        import collections
        return list((collections.Counter(nums1) & collections.Counter(nums2)).elements())