Partition Around A Pivot

Write partition(values: list[int], pivot: int) -> tuple[list[int], list[int], list[int]] that splits the values into three new lists, in their original order: those less than the pivot, those equal to it, and those greater, using one loop with an if / elif / else chain and append(). This is the step quicksort repeats on each piece. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: two lines, a space-separated list of integers (possibly empty) and then the pivot; the tests print the three returned lists on three lines, less first.