#include <iostream>
#include <algorithm>
#include <vector>
#include <set>

using namespace std;

long findMJW(long n, long m) {

	set<long> st;
	vector<long> num;

	for (long i = 1; i * i <= n; i++) {
		if (n % i == 0) {
			st.insert(n / i);
			st.insert(i);
		}
	}

	num.assign(st.begin(), st.end());
	sort(num.begin(), num.end());

	return (long)num.size() < m ? 0 : num.at(m - 1);
}