#include<stdio.h>
using namespace std;
int div(int n,int a){
    int k=a,put=0;
    while(k<=n){
        put=put+n/k;
        k*=a;
    }
    return put;
}
int main(){
    freopen("pascal.in","r",stdin);
    freopen("pascal.out","w",stdout);
    int l,m,put2,put3,put5,put02,put03,put05,k,c,put0,nr=0;
    scanf("%d%d",&l,&m);
    if(m==2||m==3||m==5)
        put2=div(l,m);
    if(m==4)
        put2=div(l,2);
    if(m==6){
        put2=div(l,2);
        put3=div(l,3);
    }
    for(c=0;c<=l;c++){
        if(m==2||m==3||m==5){
            put02=put2-div(c,m)-div(l-c,m);
            if(put02>0)
                nr++;
        }
        if(m==4){
            put02=put2-div(c,2)-div(l-c,2);
            if(put02>1)
                nr++;
        }
        if(m==6){
            put02=put2-div(c,2)-div(l-c,2);
            put03=put3-div(c,3)-div(l-c,3);
            if(put02>0&&put03>0)
                nr++;
        }
    }
    printf("%d",nr);
    return 0;
}