public void run() {
	int n = readInt("enter n: ");
	int k = readInt("enter k: ");
	int[] divisors = new int[n+1];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j<= i; j++) {
			if (i%j == 0) {
				if(checkIfPrime(j)) divisors[i]++;
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		if (divisors[i] > k) println(divisors[i]);
	}
}

private boolean checkIfPrime(int p) {
	if (p == 1) return false;
	int a = 2;
	while(a*a <= p) {
		if (p%a == 0) return false;
	}
	return true;
}