#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)
int a[10005];
int cot = 0;
bool v[1000005];
void ca(int n) {
    for (int i = 2; i <= n / i; i++) {
        if (n % i == 0) {
            if (v[n / i] == 0) {
                a[cot++] = n / i;
                v[n / i] = 1;
            }
            if (i != n / i && v[i] == 0) {
                a[cot++] = i;
                v[i] = 1;
            }
        }
    }
}
const int mol = 1000000007;
long long nm(int x) {
    long long nn = 1;
    long long kk = 2;
    while (x) {
        if (x % 2)
            nn *= kk;
        kk *= 2;
        x /= 2;
    }
    return nn - 1;
}
int main() {
    int n, m;
    cin >> n >> m;
    if (n == m) {
        cout << 1;
        return 0;
    }
    if (m == 1) {
        int cccc = 0;
        for (int i = 1; i <= n / i; i++) {
            if (n % i == 0) {
                cccc++;
                if (i != n / i) {
                    cccc++;
                }
            }
        }
        cout << cccc;
        return 0;
    }
    for (int i = n - m + 1; i <= n; i++) {
        int mmm = sqrt(i) + 1;
        int mm = min(m, mmm);
        for (int j = mm; j > 0; j--) {
            if (i % j == 0 && v[j] == 0) {
                v[j] = 1;
                a[cot++] = i / j;
                break;
            }
        }
    }
    for (int i = 1; i <= n; i++) v[i] = 0;
    int cc = 0;
    for (int i = 0; i < cot; i++) {
        if (v[a[i]] == 0) {
            cc++;
            v[a[i]] = 1;
        }
    }
    for (int i = 0; i < cot; i++) {
        ca(a[i]);
    }
    for (int i = 0; i < cot; i++) {
        if (a[i] == 1)
            cot--;
    }
    cot++;
    double ans = (nm(cc) % mol) + (nm(cc - 1) * ((nm(cot - cc) - 1) % mol)) % mol;
    if (v[1]) {
        cout << ans;
    } else
        cout << ans + 1;
}