#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 100000000

long long gcd(long long a, long long b){
	if (b == 0) return a;
	return gcd(b, a % b);
}

//aのb乗
int beki(int a,int b){
	int x = 1;
	while(b!=0){
		if(b&1){
			x=mod(x*a);
		}
		a=mod(a*a);
		b>>=1;
	}
	return x;
}

//aの逆元
int gyakugen(int a){
	return beki(a,modulo-2);
}

struct combi{
	deque<int> kaijou;
	deque<int> kaijou_;
	
	void kaijou_set(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(mod(kaijou[i-1]*i));
		}
		
		int b=gyakugen(kaijou[n]);
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(mod(kaijou_[0]*k));
		}
	}
	
	int combination(int n,int r){
		if(r>n)return 0;
		int a = mod(kaijou[n]*kaijou_[r]);
		a=mod(a*kaijou_[n-r]);
		return a;
	}
	
	int junretsu(int a,int b){
		int x = mod(kaijou_[a]*kaijou_[b]);
		x=mod(x*kaijou[a+b]);
		return x;
	}
	
};

int main(){
	
	int N,K;
	cin>>N>>K;
	
	combi C;
	C.kaijou_set(N+2);
	
	int ans = 0;
	
	//set<pair<int,int>> S;
	set<int> S;
	for(int i=2;i<=N;i++){
		if(N%i==0&&K%i==0){
			int a = N/i;
			int b = K/i;
			
			int cnt = 1;
			for(auto X:S){
				if(X%a==0){
					cnt --;
				}
			}
		
			//cout<<C.combination(a,b)<<endl;
			ans = mod(ans + mod(cnt*C.combination(a,b)));
			S.insert(a);
			//S.insert({a/gcd(a,b),b/gcd(a,b)});
		}
	}
	
	cout<<ans<<endl;
	
	return 0;
}