Given two positive integers n and k.

A factor of an integer n is defined as an integer i where n % i == 0.

Consider a list of all factors of n sorted in **ascending order**, return *the *kth* factor* in this list or return **-1** if n has less than k factors.

Input:n = 12, k = 3Output:3Explanation:Factors list is [1, 2, 3, 4, 6, 12], the 3rd factor is 3.

Input:n = 7, k = 2Output:7Explanation:Factors list is [1, 7], the 2nd factor is 7.

Input:n = 4, k = 4Output:-1Explanation:Factors list is [1, 2, 4], there is only 3 factors. We should return -1.

Input:n = 1, k = 1Output:1Explanation:Factors list is [1], the 1st factor is 1.

Input:n = 1000, k = 3Output:4Explanation:Factors list is [1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 100, 125, 200, 250, 500, 1000].

- 1 <= k <= n <= 1000

Solution:

class Solution { public int kthFactor(int n, int k) { int p = 0; for (int i = 1; i <= n; i ++) { if (n % i == 0) { p ++; } if (p == k) { return i; } } return -1; } }