fn solve(n: usize, k: usize) -> usize {
    let mut flgs: Vec<bool> = vec![true; n+1];
    flgs[0] = false;
    flgs[1] = false;
    let lim = (n as f64).sqrt().ceil() as usize;
    let mut pcount: Vec<usize> = vec![0; n+1];
    for i in 2..=lim {
        if !flgs[i] { continue; }
        for j in 1..=n/i {
            flgs[i*j] = false;
            pcount[i*j] += 1;
        }
    }
    pcount.iter().enumerate()
        .filter(|pair| *pair.1 >= k)
        .count()
}

fn main() {
    let mut nk = String::new();
    std::io::stdin().read_line(&mut nk).ok();
    let nk: Vec<usize> = nk.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();

    println!("{}", solve(nk[0], nk[1]));
}