func main()
	var n: int :: cui@inputInt()
	var k: int :: cui@inputInt()
	if(k = 1)
		do cui@print("\{n - 1}\n")
		ret
	end if
	var a: []int :: #[n + 1]int
	var i: int :: 2
	var isPrime: []bool :: sieve(2000000)
	while loop(i * i <= n)
		if(isPrime[i])
			var x: int :: i
			while(x <= n)
				do a[x] :+ 1
				do x :+ i
			end while
		end if
		do i :+ 1
	end while
	
	func sieve(n: int): []bool
		var isPrime: []bool :: [true].repeat(n + 1)
		do isPrime[0] :: false
		do isPrime[1] :: false
		for i(2, n)
			if(isPrime[i])
				var j: int :: i * i
				while(j <= n)
					do isPrime[j] :: false
					do j :+ i
				end while
			end if
		end for
		ret isPrime
	end func
	
	var ans: int :: 0
	for j(2, n)
		if(a[j] >= k)
			do ans :+ 1
		end if
	end for
	do cui@print("\{ans}\n")
end func