#include <bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 const ll mod=(ll)1e9+;

 ll qPow(ll a,ll b,ll m)

 {

     ll ret=1ll;

     while(b){

         if(b&) ret=(ret*a)%m;

         a=a*a%m;

         b>>=;

     }

     return ret;

 }

 map<ll , ll> F;

 ll getF(ll t){

     if(F.count(t)){

         return F[t];

     }

     ll ans=qPow(2ll,t-,mod);

     for(ll i=2ll;i*i<=t;++i){

         if(t%i) continue;

         ll j=t/i;

         if(i!=j) ans=ans-getF(i)+mod-getF(j)+mod;

         else ans=ans-getF(i)+mod;

         ans%=mod;

     }

     ans=(ans-F[]+mod)%mod;

     F[t]=ans;

     return F[t];

 }

 int main(){

     ios::sync_with_stdio(false);cin.tie();

     ll XX,YY;

     cin>>XX>>YY;

     if(YY%XX){

         cout<<<<endl;

     }

     else{

         ll tot=YY/XX;

         F[]=1ll;

         cout<<getF(tot)<<endl;

     }

     return ;

 }