#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<ll,ll> P;

void extended_euclid(ll x,ll y,ll *c,ll *a,ll *b){
  ll a0,a1,a2,b0,b1,b2,r0,r1,r2,q;r0=x;r1=y;a0=1;a1=0;b0=0;b1=1;
  while(r1>0){q=r0/r1;r2=r0%r1;a2=a0-q*a1;b2=b0-q*b1;r0=r1;r1=r2;a0=a1;a1=a2;b0=b1;b1=b2;}
  *c=r0;*a=a0;*b=b0;
}

ll get_inv(ll n, ll p){
  ll a,b,c;
  extended_euclid(n,p,&c,&a,&b);
  if(a<p) a+=p;
  return a%p;
}

ll fact[2000100],fact_inv[2000100];

void init() {
  fact[0]=1;
  REP(i,1,2000100) fact[i]=fact[i-1]*i%MAX;
  fact_inv[2000050]=get_inv(fact[2000050],MAX);
  rrep(i,2000050)fact_inv[i]=fact_inv[i+1]*(i+1)%MAX;
}

ll nCr(ll N,ll K){
  if(K<0||K>N)return 0;
  return fact[N]*fact_inv[K]%MAX*fact_inv[N-K]%MAX;
}

vector<int> sieve(int n) {
  vector<int> p(n);p[2]=2;
  for(int i=3;i<n;i+=2)p[i]=i;
  for(int i=3;i*i<n;i+=2)if(p[i])for(int j=i*i;j<n;j+=i)p[j]=0;
  p.erase(remove(p.begin(), p.end(), 0), p.end());
  return p;
}

void Main() {
  init();
  vector<int> p=sieve(1000000);
  ll n,m;
  cin >> n >> m;
  if(m%2) {
    pr(0);
    return;
  }
  ll ans=0;
  ll d[n+1];
  mem(d);
  vector<ll> v;
  for(int i=0; p[i]*p[i]<=n; i++) {
    int k=p[i];
    if(n%k==0&&m%k==0) {
      d[k]=nCr(n/k,m/k);
      v.pb(k);
      if(k*k!=n&&n%(n/k)==0&&m%(n/k)==0) d[n/k]=nCr(n/(n/k),m/(n/k));
    }
  }
  ll c[n+1];
  mem(c);
  rep(i,v.size()) {
    for(int j=1; j*v[i]<n; j++) {
      c[j*v[i]]^=1;
    }
  }
  rep(i,n) {
    if(c[i]) ans+=d[i];
    else ans-=d[i];
  }
  pr(ans);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}