#include <fstream>

using namespace std;

ifstream fin("pascal.in");
ofstream fout("pascal.out");

const int kk=5000001;
int ans, v[kk], w[kk];

void basicsolve(int n, int d)
{
    for(int i=d; i<=n; i*=d)
        for(int j=i; j<=n; j+=i)
            v[j]++;
    for(int i=1; i<=n; i++)
    {
        v[i]=v[i-1]+v[i];
    }
    for(int i=0; i<=(n-1)/2; i++)
    {
        if(v[n]>(v[n-i]+v[i]))
            ans+=2;
    }
    if(n%2==0)
    {
        if(v[n]>(v[n/2]+v[n/2]))
            ans++;
    }
}

void solve4(int n)
{
    for(int i=2; i<=n; i*=2)
        for(int j=i; j<=n; j+=i)
            v[j]++;
    for(int i=1; i<=n; i++)
    {
        v[i]=v[i-1]+v[i];
    }
    for(int i=0; i<=(n-1)/2; i++)
    {
        if(v[n]>(v[n-i]+v[i]+1))
            ans+=2;
    }
    if(n%2==0)
    {
        if(v[n]>(v[n/2]+v[n/2]+1))
            ans++;
    }
}

void solve6(int n)
{
    for(int i=2; i<=n; i*=2)
        for(int j=i; j<=n; j+=i)
            v[j]++;
    for(int i=1; i<=n; i++)
    {
        v[i]=v[i-1]+v[i];
    }
    for(int i=3; i<=n; i*=3)
        for(int j=i; j<=n; j+=i)
            w[j]++;
    for(int i=1; i<=n; i++)
    {
        w[i]=w[i-1]+w[i];
    }
    for(int i=0; i<=(n-1)/2; i++)
    {
        if((v[n]>(v[n-i]+v[i])) && (w[n]>(w[n-i]+w[i])))
            ans+=2;
    }
    if(n%2==0)
    {
        if((v[n]>(v[n/2]+v[n/2])) && (w[n]>(w[n/2]+w[n/2])))
            ans++;
    }
}

int main()
{
    int n,d,c=0;
    fin>>n>>d;
    if(d==2 || d==3 || d==5)
    {
        basicsolve(n, d);
        fout<<ans;
    }
    if(d==4)
    {
        solve4(n);
        fout<<ans;
    }
    if(d==6)
    {
        solve6(n);
        fout<<ans;
    }
    return 0;
}