#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAX = 1000010;
ll inv[MAX],fact[MAX],fi[MAX],mod = 1000000007;
void inverse(){
	int i;
	inv[1] = 1;
	for(i=2;i<MAX;i++){
		inv[i] = mod - (mod/i)*inv[mod%i]%mod;
	}
	fact[0] = fi[0] = 1;
	for(i=1;i<MAX;i++){
		fact[i] = fact[i-1]*i%mod;
		fi[i] = (fi[i-1]*inv[i])%mod;
	}
}

ll comb(int n,int k){
	if(n<0 || k<0 || n<k){
		return 0;
	}else{
		return fact[n]%mod*fi[k]%mod*fi[n-k]%mod;
	}
}
ll ans = 0,cnt[1000010] = {};
vector<ll> v;
int main(){
	int i,j,n,k;
	cin >> n >> k;
	for(i=2;i*i<=n;i++){
		if(n%i==0){
			v.push_back(i);
			if(i*i!=n){
				v.push_back(n/i);
			}
		}
	}
	inverse();
	sort(v.begin(),v.end());
	for(i=0;i<v.size();i++){
		ll x = v[i];
		if(k%(n/x)!=0) continue;
		cnt[x] = comb(x,x*k/n);
		for(j=2;j*j<=x;j++){
			if(x%j==0){
				cnt[x] -= cnt[j];
				if(cnt[x]<0) cnt[x] += mod;
				if(j*j!=x){
					cnt[x] -= cnt[x/j];
					if(cnt[x]<0) cnt[x] += mod;
				}
			}
		}
		ans += cnt[x];
	}
	cout << ans << endl;
}