using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using static System.Text.StringBuilder;
using System.Text.RegularExpressions;
using System.Globalization;
using System.Diagnostics;
using static System.Console;
//using System.Numerics;
//using static System.Math;
//using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;


    void solve()
    {
        int N = cin.nextint;
        int M = cin.nextint;

        var A = Enumerable.Range(1, N).ToArray();

        if (M > 1)
        {
            long cnt = N / M;
            long ans = cnt * (cnt - 1) % mod;
            for (int i = 1; i <= N - 2; i++)
            {
                ans *= i;
                ans %= mod;
            }

            WriteLine(ans);
        }
        else
        {
            var P = new long[N + 1];
            var F = new long[N + 1];
            for (int i = 0; i <= N; i++)
            {
                P[i] = 1;
                F[i] = i;
            }
            for (int i = 2; i <= N; i++)
            {
                if (P[i] > 0)
                {
                    F[i] -= F[i] / i;
                    for (int j = i + 1; j < N; j += i)
                    {
                        P[j] = 0;
                        F[j] -= F[j] / i;
                    }
                }
            }
            //WriteLine(string.Join(" ", F));
            long sum = 0;
            for (int i = 2; i <= N; i++)
            {
                sum += F[i];
                sum %= mod;
            }
            long ans = sum * 2 % mod;
            for (int i = 1; i <= N - 2; i++)
            {
                ans *= i;
                ans %= mod;
            }
            WriteLine(ans);
        }

    }

    long gcd(long a, long b)
    {
        return (b != 0) ? gcd(b, a % b) : a;
    }

    long lcm(long a, long b)
    {
        var d = gcd(a, b);
        return a / d * b;
    }

    //a^b(mod p) solution works in O(logb).
    long powmod(long a, long b, long p)
    {
        if (b == 0) return 1;
        if (b % 2 == 0)
        {
            long d = powmod(a, b / 2, p);
            return d * d % p;
        }
        else
        {
            return a % p * powmod(a, b - 1, p) % p;
        }
    }

}

class Scanner
{
    string[] s; int i;
    char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan { get { return ReadLine().Split(); } }
    public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
    public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
    public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint { get { return int.Parse(next); } }
    public long nextlong { get { return long.Parse(next); } }
    public double nextdouble { get { return double.Parse(next); } }
}