#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int num = 0;
long long ans[10005] = { 0 };
int B[1000005];
bool cmp(const int& x, const int& y) { return x > y; }
int fun(int x) {
    int flag = 1;
    for (int i = 2; i <= x / i; i++) {
        if (x % i == 0) {
            fun(i);
            fun(x / i);
            flag = 0;
        }
    }
    if (x >= 2 && flag) {
        if (ans[x] == 0)
            num++;
        ans[x]++;
    }
    return flag;
}
int main() {
    long long N = 1e9 + 7;
    int n, m;
    cin >> n >> m;
    for (int i = n - m + 1; i <= n; i++) B[i] = i;
    for (int i = m; i >= 1; i--) {
        int k = n / i;
        while (B[i * k] < i) k--;
        B[i * k] /= i;
    }
    for (int i = n - m + 1; i <= n; i++) {
        fun(B[i]);
    }
    sort(ans, ans + 100005, cmp);
    long long c = ans[0];
    for (int i = 1; i < num; i++) {
        c = (c + ans[i] + c * ans[i]) % N;
    }
    printf("%lld", (c + 1) % N);
    return 0;
}