/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */

#include <iostream>
#include <fstream>

#ifndef SOLUTION_COMMON_H

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using PI = pair<int, int>;
template<class T> using V = vector<T>;
using VI = V<int>;
#define _1 first
#define _2 second

#ifdef MY_DEBUG
# define DEBUG(x) x
#else
# define DEBUG(x)
#endif

template<class T>
inline void debug(T &A) {
  DEBUG(
      for (const auto &a : A) {
        cerr << a << " ";
      }
      cerr << '\n';
  )
}

template<class T, class Func>
inline void debug_with_format(T &A, Func f) {
  DEBUG(
      for (const auto &a : A) {
        cerr << f(a) << " ";
      }
      cerr << '\n';
  )
}

template<class T>
inline void debug_dim2(T &A) {
  DEBUG(
      for (const auto &as : A) {
        debug(as);
      }
  )
}

template<typename ... Args>
inline void debug(const char *format, Args const &... args) {
  DEBUG(
      fprintf(stderr, format, args ...);
      cerr << '\n';
  )
}

template<typename ... Args>
string format(const string &fmt, Args ... args) {
  size_t len = snprintf(nullptr, 0, fmt.c_str(), args ...);
  vector<char> buf(len + 1);
  snprintf(&buf[0], len + 1, fmt.c_str(), args ...);
  return string(&buf[0], &buf[0] + len);
}

template<class T1, class T2>
string fmtP(pair<T1, T2> a) {
  stringstream ss;
  ss << "(" << a._1 << "," << a._2 << ")";
  return ss.str();
}

#define SOLUTION_COMMON_H

#endif //SOLUTION_COMMON_H


int msb(int i) {
  i |= (i >>  1);
  i |= (i >>  2);
  i |= (i >>  4);
  i |= (i >>  8);
  i |= (i >> 16);
  return i - (((unsigned int)i) >> 1);
}

int log2(int x) {
  int i = 0;
  while(x >>= 1) i++;
  return i;
}

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

VI divisors(int x) {
  VI D, back;
  int rt = (int)sqrt(x);
  for (int d = 1; d <= rt; ++d) {
    if (x % d == 0) {
      D.push_back(d);
      if (d * d != x) back.push_back(x / d);
    }
  }
  D.insert(D.end(), back.rbegin(), back.rend());
  return D;
}

ll pow_mod(ll x, int k, ll m) {
  if (k == 0) return 0;
  else if (k == 1) return x;
  else {
    ll a = pow_mod(x * x % m, k / 2, m);
    if (k % 2 == 1) a = a * x % m;
    return a;
  }
}

//inline void add(ll &a, ll b) {
//  a += b;
//  if (a >= MOD) a -= MOD;
//}
//
//inline void sub(ll &a, ll b) {
//  a += MOD - b;
//  if (a >= MOD) a -= MOD;
//}
//
//inline void mul(ll &a, ll b) {
//  a = a * b % MOD;
//}


class Comb {
public:
  int MOD;
  V<ll> F, I;

  Comb(int N, int MOD): MOD(MOD), F(N + 1), I(N + 1) {
    F[0] = 1;
    for (int i = 1; i <= N; ++i) {
      F[i] = F[i - 1] * i % MOD;
    }

    I[N] = pow_mod(F[N], MOD - 2, MOD);
    for (int i = N - 1; i >= 0; --i) {
      I[i] = I[i + 1] * (i + 1) % MOD;
    }
  }

  static ll pow_mod(ll x, int k, int MOD) {
    ll res = k >= 2 ? pow_mod(x * x % MOD, k / 2, MOD) : 1ll;
    if (k&1) res = res * x % MOD;
    return res;
  };

  ll operator()(int n, int k) {
    if (k < 0 || k > n) return 0ll;
    return F[n] * I[n - k] % MOD * I[k] % MOD;
  };

  ll rev(int x) {
    return F[x - 1] * I[x] % MOD;
  }
};

const int MOD = 1000000007;

class D {
public:
  void solve(std::istream& in, std::ostream& out) {
    int n, k;
    in >> n >> k;
    int g = gcd(n, k);
    Comb c(n, MOD);

    ll ans = 0ll;
    V<ll> dp(n + 1);
    for (int grp = g; grp > 1; --grp) {
      if (g % grp == 0) {
        int d = n/grp;
        dp[d] = (dp[d] + c(n / grp, k / grp)) % MOD;
        ans += dp[d];
        int j = d * 2;
        while(j <= n) {
          dp[j] = (MOD + dp[j] - dp[d]) % MOD;
          j += d;
        }
      }
    }
    debug(dp);
    out << ans % MOD;
  }
};


int main() {
	D solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}