
def 		lowercase_    (     A__	)							->							list[list[int]]:
    """simple docstring"""

    snake_case				  =      []
    if len(A__	) == 1:
        return [nums.copy()]
    for _ in range(len(A__	)	):
        snake_case				  =      nums.pop(0	)
        snake_case				  =      permute(A__	)
        for perm in permutations:
            perm.append(A__	)
        result.extend(A__	)
        nums.append(A__	)
    return result



def 		lowercase_    (     A__	)							->							Optional[int]:
    """simple docstring"""

    def backtrack(A__	):
        if start == len(A__	) - 1:
            output.append(nums[:]	)
        else:
            for i in range(A__				,	len(A__	)	):
                snake_case  ,							snake_case				  =      nums[i], nums[start]
                backtrack(start + 1	)
                snake_case  ,							snake_case				  =      nums[i], nums[start]  # backtrack

    snake_case				  =      []
    backtrack(0	)
    return output


if __name__ == "__main__":
   import doctest

   # use res to print the data in permute2 function
   _A						      =				permutea([1, 2, 3])
   print(res)
   doctest.testmod()



def 		lowercase_    (     A__				,	A__	)							->							List[Any]:
    """simple docstring"""

    snake_case				  =      [0 for i in range(r + 1	)]
    # nc0 = 1
    snake_case				  =      1
    for i in range(1				,	n + 1	):
        # to compute current row from previous row.
        snake_case				  =      min(A__				,	A__	)
        while j > 0:
            c[j] += c[j - 1]
            j -= 1
    return c[r]





print(binomial_coefficient(n=10, r=5))

