#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL n, m, d[100001], MOD = 1e9 + 7;

LL mu[100001];
void init_mu(int n) {
	incII(i, 0, n) { mu[i] = 0; }
	
	incII(i, 2, n) {
		if(mu[i] != 0) { continue; }
		for(int j = i; j <= n; j += i) { mu[j]++; }
	}
	incII(i, 2, n) {
		LL s = 1LL * i * i;
		if(n < s) { break; }
		for(int j = s; j <= n; j += s) { mu[j] = -1; }
	}
	inc1(i, n) { 
		mu[i] = (mu[i] == -1 ? 0 : (mu[i] % 2 == 0 ? +1 : -1));
	}
}

int main() {
	cin >> n >> m;
	
	init_mu(n);
	
	LL ans = 0;
	inc1(i, n) { d[i] = 1LL * (n / i) * (n / i - 1) % MOD; }
	inc1(i, n) {
		if(i % m != 0) { continue; }
		(ans += (MOD + mu[i / m] * d[i]) % MOD) %= MOD;
	}
	inc1(i, n - 2) { (ans *= i) %= MOD; }
	
	cout << ans << endl;
	
	return 0;
}