def compute_pareto_front(costs: list):
    """
    Find rows of entries in the Pareto front.
    Parameters
    ----------
    costs: list of arrays
        List of arrays of costs.

    Returns
    -------
    front_ids: list of ints
        List of row indices of elements from the pareto front.
    """
    front_ids = []
    n_points = len(costs)
    for ind1 in range(n_points):
        pareto = True
        for ind2 in range(n_points):
            r11, r12 = costs[ind1]
            r21, r22 = costs[ind2]

            if ind1 != ind2:
                if (r21 > r11 and r22 >= r12) or (r21 >= r11 and r22 > r12):
                    pareto = False
                    break
        if pareto:
            front_ids.append(ind1)
    return front_ids