import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;

public class Main {
	
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		final int N = sc.nextInt();
		final int K = sc.nextInt();
		
		boolean[] is_prime = new boolean[N + 1];
		Arrays.fill(is_prime, true);
		is_prime[0] = is_prime[1] = false;
		
		int[] prime_count = new int[N + 1];
		for(int i = 0; i <= N; i++){
			if(is_prime[i]){
				prime_count[i] = 1;
				
				for(int j = i + i; j <= N; j += i){
					is_prime[j] = false;
					prime_count[j]++;
				}
			}
		}
		
		int count = 0;
		for(int i = 0; i <= N; i++){
			if(prime_count[i] >= K){
				count++;
			}
		}
		
		System.out.println(count);
	}
	
}