class Solution:
    def kthSmallestPrimeFraction(self, arr: list[int], k: int) -> list[int]:
        fractions: list = []
        size: int = len(arr)

        for i in range(size):
            for j in range(i + 1, size):
                num: int = arr[i]
                denom: int = arr[j]

                fractions.append([num, denom])

        fractions.sort(key=lambda x: x[0] / x[1])

        return fractions[k - 1]