#include <cstdio>
/*#include <algorithm>
#include <iostream>
using namespace std;
int a[101],n,k;
*/
int main()
{
  /*  while(1)
    {
    int posib=0;
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++) a[i]=i;
    do
    {
            int sum=0;
            bool as=0;
            for(int i=1;i<k;i++) sum+=a[i];
            for(int i=k;i<=n;i++)
            {
                    sum+=a[i];
                    sum-=a[i-k];
                    if(sum%k!=0) as=1;
            }
            if(as==0) posib++; 
    }while(next_permutation(a+1,a+n+1));
    printf("%d\n",posib);
}
*/
  freopen ("kperm.in","r",stdin);
  freopen ("kperm.out","w",stdout);
  int n,k;
  scanf("%d%d",&n,&k);
  if(k&(k-1)==0) printf("0\n");  
}