1
class Solution:
2
    def kthFactor(self, n: int, k: int) -> int:
3
        start = [1]
4
        end = [n]
5
        for i in range(2, math.ceil(math.sqrt(n)) + 1):
6
            if n % i == 0:
7
                start.append(i)
8
                if i != n // i:
9
                    end.append(n // i)
10
        start = sorted(set(start).union(set(end)))
11
        if k <= len(start):
12
            return start[k - 1]
13
        else:
14
            return -1