using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;
using System.IO;

class Program
{
    static private Magatro M = new Magatro();
    static private void Main(string[]args)
    {
        M.Scan();
        M.Solve();
    }
}
public class Scanner
{
    private string[] S;
    private int Index;
    private char Separator;
    public Scanner(char separator = ' ')
    {
        Index = 0;
        Separator = separator;
    }
    private string[] Line()
    {
        return Console.ReadLine().Split(Separator);
    }
    public string Next()
    {
        string result;
        if (S == null || Index >= S.Length)
        {
            S = Line();
            Index = 0;
        }
        result = S[Index];
        Index++;
        return result;
    }
    public int NextInt()
    {
        return int.Parse(Next());
    }
    public double NextDouble()
    {
        return double.Parse(Next());
    }
    public long NextLong()
    {
        return long.Parse(Next());
    }
}
public class Magatro
{
    private int N, K;
    public void Scan()
    {
        Scanner sc = new Scanner();
        N = sc.NextInt();
        K = sc.NextInt();
    }
    public void Solve()
    {
        bool[] use = new bool[N+1];
        for(int i = 2; i <= N; i++)
        {
            if (use[i]) continue;
            if (DivisorCnt(i) >= K)
            {
                for (int j = i; j <= N; j += i) use[j] = true;
            }
        }
        int ans = 0;
        for(int i = 2; i <= N; i++)
        {
            if (use[i]) ans++;
        }
        Console.WriteLine(ans);
    }
    private int DivisorCnt(int n)
    {
        int result = 0;
        if (n % 2 == 0)
        {
            result++;
            while (n% 2 == 0) n/= 2;
        }
        int loop = (int)Math.Sqrt(n);
        for(int i = 3; i <= loop; i += 2)
        {
            if (n % i == 0)
            {
                result++;
                while (n % i == 0) n /= i;
            }
            if (n == 1) return result;
        }
        return result+1;
    }
}