#include<stdio.h>
int n,p;
int prim(int a,int b)
{
    int r=a%b;
    while(r)
    {
        a=b;
        b=r;
        r=a%b;
    }
    if (b==1)
        return 1;
    return 0;
}
int main()
{
    int nr=0,contor=0;
    FILE *fin,*fout;
    fin=fopen("frac.in","r");
    fout=fopen("frac.out","w");
    fscanf(fin,"%d%d",&n,&p);
    while (contor<p)
    {
        nr++;
        if(prim(n,nr))
            contor++;
    }
    fprintf(fout,"%d",contor);
    return 0;
}