/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.10.06 15:32:52
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

template< int MOD >
struct mint {
public:
    long long x;
    mint(long long x = 0) :x((x%MOD+MOD)%MOD) {}
    mint(std::string &s) {
        long long z = 0;
        for (int i = 0; i < s.size(); i++) {
            z *= 10;
            z += s[i] - '0';
            z %= MOD;
        }
        this->x = z;
    }
    mint& operator+=(const mint &a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint &a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint &a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint& operator/=(const mint &a) {
        long long n = MOD - 2;
        mint u = 1, b = a;
        while (n > 0) {
            if (n & 1) {
                u *= b;
            }
            b *= b;
            n >>= 1;
        }
        return *this *= u;
    }
    mint operator+(const mint &a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-() const {return mint() -= *this; }
    mint operator-(const mint &a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint &a) const {
        mint res(*this);
        return res *= a;
    }
    mint operator/(const mint &a) const {
        mint res(*this);
        return res /= a;
    }
    friend std::ostream& operator<<(std::ostream &os, const mint &n) {
        return os << n.x;
    }
    friend std::istream &operator>>(std::istream &is, mint &n) {
        long long x;
        is >> x;
        n = mint(x);
        return is;
    }
    bool operator==(const mint &a) const {
        return this->x == a.x;
    }
    mint pow(long long k) const {
        mint ret = 1;
        mint p = this->x;
        while (k > 0) {
            if (k & 1) {
                ret *= p;
            }
            p *= p;
            k >>= 1;
        }
        return ret;
    }
};
constexpr int MOD = 1e9 + 7;



template < class T >
void divisor_transform(std::vector< T >& a, bool zeta, bool subset) {
    int n = a.size();
    std::vector< bool > sieve(n, false);
    for (int p = 2; p < n; ++p) {
        if (sieve[p]) continue;
        if (subset) {
            if (zeta) for (int k=0; k*p<n; k++) sieve[k*p]=true, a[k*p]+=a[k];
            else for (int k=(n-1)/p; k>=0; k--) sieve[k*p]=true, a[k*p]-=a[k];
        }
        else {
            if (zeta) for (int k=(n-1)/p; k>=0; k--) sieve[k*p]=true, a[k]+=a[k*p];
            else for (int k=0; k*p<n; k++) sieve[k*p]=true, a[k]-=a[k*p];
        }
    }
}
int main() {
    int n,m;cin >> n >> m;
    if (n < m) {
        cout << 0 << endl;
    }
    else {
        vector<mint<MOD>> a(n+1,1);
        divisor_transform(a,true,false);
        for (int i = 0; i < n+1; i++) {
            a[i] *= a[i];
        }
        divisor_transform(a,false,false);
        mint<MOD> ans = a[m]-1;
        for (int i = 2; i <= n-2; i++) {
            ans *= i;
        }
        cout << ans << endl;
    }
    return 0;
}