package main

import "fmt"

func getPrime(n, k int) {
	p := make([]bool, n+1) // false: 素数の可能性有 true: notPrime
	m := make([]int, n+1)
	ans := 0
	for i := 2; i <= n; i++ {
		if !p[i] {
			for j := i; j <= n; j += i {
				p[j] = true
				m[j]++
			}
		}
		if m[i] >= k {
			ans++
		}
	}
	fmt.Println(ans)
	return
}

func main() {
	var N, K int
	fmt.Scan(&N, &K)
	getPrime(N, K)
}