import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Main p = new Main();
	}

	public Main() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int k = sc.nextInt();
		System.out.println(solve(n, k));
	}

	public int solve(int n, int k) {
		int[] sieve = new int[n+1];
		Arrays.fill(sieve, Integer.MAX_VALUE);
		
		for(int i=2;i<sieve.length;i++){
			if(sieve[i] != Integer.MAX_VALUE)
				continue;
			
			for(int j=i;j<sieve.length;j+=i)
				if(sieve[j] == Integer.MAX_VALUE)
					sieve[j] = i;
		}
		
		int res = 0;
		for(int i=2;i<sieve.length;i++){
			int cur = i;
			int count = 0;
			while(cur > 1){
				int j = sieve[cur];
				while(cur%j==0)
					cur /= j;
				
				count++;
			}
			
			if(count>=k)
				res++;
//			System.out.println(String.format("%6d : %3d", i, count));
		}
		
		return res;
	}

}