#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define mod 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)

template<typename T>
vector<T> divisor(T n)
{
    vector<T> res;
    for(T i=1;(long long)i*i<=n;i++){
        if(n%i==0){
            res.push_back(i);
            if(i != n/i){
                res.push_back(n/i);
            }
        }
    }
    sort(res.rbegin(),res.rend());
    return res;
}
#define MAX_N 400010
#define MOD 1000000007

int inv[MAX_N],fac[MAX_N],finv[MAX_N];

void make()
{
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i=2;i<MAX_N;i++){
        inv[i] = MOD - (long long)inv[MOD%i] * (MOD/i) % MOD;
        fac[i] = (long long)fac[i-1] * i % MOD;
        finv[i] = (long long)finv[i-1] * inv[i] % MOD;
    }
}

int comb(int a,int b)
{
    if(a < b){
        return 0;
    }
    return fac[a] * ((long long)finv[b] * finv[a-b] % MOD) % MOD;
}
ll dp[2000000]={};
    
int main(){
    make();
    int n,k;
    cin >> n >> k;
    vector<int> res = divisor(n);
    ll sm = 0;
    for(int x:res){
        if(x==1)continue;
        if(k%x==0){
            int c = k/x;
            int p = n/x;
            dp[x] = comb(p,c);
            for(int i=x+x;i<=n;i+=x){
               dp[x] += mod-dp[i];
               dp[x] %= mod;
            }
            sm += dp[x];
            sm %= mod;
        }
    }
    cout << sm << endl;
    return 0;
}