
    Given a list of route segment times and a list of delivery priority scores, determine the N most efficient delivery assignments by finding the N largest products of route times and priority scores, where each assignment must use one route time and one priority score. Each route time and priority score can only be used once in the final assignments.
    

    
def large_product(nums1, nums2, N):
    """
    Given a list of route segment times and a list of delivery priority scores, determine the N most efficient delivery assignments by finding the N largest products of route times and priority scores, where each assignment must use one route time and one priority score. Each route time and priority score can only be used once in the final assignments.
    

    """
def large_product(nums1, nums2, N):
    """
    Given a list of route segment times and a list of delivery priority scores, determine the N most efficient delivery assignments by finding the N largest products of route times and priority scores, where each assignment must use one route time and one priority score. Each route time and priority score can only be used once in the final assignments.
    

    """
    result = sorted([x * y for x in nums1 for y in nums2], reverse=True)[:N]
    return result