def triplets(a, b, c):
    # Use binary search to find where q is, or should be in the array
    def binary_search(arr, target):
        high, low = len(arr) - 1, 0
        mid = (high + low) // 2
        sample = arr[mid]
        l_arr = len(arr)
        while low <= high:
            if target < sample:
                high = mid - 1
            elif target > sample:
                low = mid + 1
            else:
                # Add 1 since we want count of elements q is >=
                return mid + 1
            
            mid = (high + low ) // 2
            sample = arr[mid]
        
        # Add 1 since we want count of elements q is >=
        return high + 1  # Will be 0 or len(arr)
    
    a, b, c = list(set(a)), list(set(b)), list(set(c))
    a.sort()
    b.sort()
    c.sort()

    a_len, c_len = len(a), len(c)
    max_pr = product = result = 0
    for q in b:
        if max_pr:
            result += max_pr
        else:   
            p = binary_search(a, q)
            r = binary_search(c, q)
            if p and r:
                product = p * r
                if p == a_len and r == c_len:
                    # Once q is > all elements in p and r, simply resuse
                    # this max product.
                    max_pr = product

                result += product
    
    return result

import bisect
def triplets(a, b, c):
    count = 0
    a = list(set(a))
    b = list(set(b))
    c = list(set(c))
    a.sort()
    b.sort()
    c.sort()
    for element in b:
        c1 = bisect.bisect(a,element)
        c2 = bisect.bisect(c,element)
        count += c1*c2
    return count