from typing import List


def brute_force(num_lst: List[int], pivot: int) -> List[int]:
    """
    Given a list and a pivot, sort so that all elements to the left of the pivot(s) are less than the pivot
    and all elements to the right of the pivot(s) are greater than the pivot. Runs in O(3n) but not constant storage.

    :param num_lst: the list of numbers
    :param pivot: the pivot element
    :return: a list as described above

    >>> brute_force([10, 5, 3, 11, 10, 2, 4, 12], 10)
    [5, 3, 2, 4, 10, 10, 11, 12]
    """
    return [x for x in num_lst if x < pivot] + [x for x in num_lst if x == pivot] + [x for x in num_lst if x > pivot]