using System;
using System.Collections.Generic;
using System.IO;

namespace Sandbox
{
    internal class Program
    {
        struct Div
        {
            public int J;
            public int Min;
            public int Max;
        }

        private static ModInt[,] DpKJ;

        private static ModInt GetDp(int ki, int j)
        {
            return DpKJ[ki - 1, j];
        }

        private static void SetDp(int ki, int j, ModInt count)
        {
            DpKJ[ki - 1, j] += count;
        }

        private static void Main(string[] args)
        {
            var scanner = new Scanner();
            var n = scanner.GetNextAsInt();
            var k = scanner.GetNextAsInt();

            var divisors = new List<Div>();

            var jj = 1;
            while (true)
            {
                var maxj = n / jj;
                if (maxj <= 0)
                {
                    break;
                }
                var jjnext = n / maxj;

                divisors.Add(new Div()
                {
                    J = n / jj,
                    Min = jj,
                    Max = jjnext
                });

                jj = jjnext + 1;
            }

            DpKJ = new ModInt[k, divisors.Count];

            for (var ki = 1; ki <= k; ki++)
            {
                if (ki == 1)
                {
                    for (var j = 0; j < divisors.Count; j++)
                    {
                        SetDp(ki, j, 1);
                    }
                    continue;
                }

                var tmp = new ModInt();
                for (var j = 0; j < divisors.Count; j++)
                {
                    var divisor = divisors[j];
                    var range = divisor.Max - divisor.Min + 1;
                    tmp += GetDp(ki - 1, j) * range;
                    var j2 = divisors.Count - j - 1;
                    SetDp(ki, j2, tmp);
                }
            }

            var sum = new ModInt();
            for (var j = 0; j < divisors.Count; j++)
            {
                var divisor = divisors[j];
                sum += GetDp(k, j) * (divisor.Max - divisor.Min + 1);
            }

            Console.WriteLine(sum);
        }

        #region ModInt
    /// <summary>
    /// [0,<see cref="Mod"/>) までの値を取るような数
    /// </summary>
    public struct ModInt
    {
        /// <summary>
        /// 剰余を取る値．
        /// </summary>
        public const long Mod = (int)1e9 + 7;

        /// <summary>
        /// 実際の数値．
        /// </summary>
        public long num;

        /// <summary>
        /// 値が <paramref name="n"/> であるようなインスタンスを構築します．
        /// </summary>
        /// <param name="n">インスタンスが持つ値</param>
        /// <remarks>パフォーマンスの問題上，コンストラクタ内では剰余を取りません．そのため，<paramref name="n"/> ∈ [0,<see cref="Mod"/>) を満たすような <paramref name="n"/> を渡してください．このコンストラクタは O(1) で実行されます．</remarks>
        public ModInt(long n) { this.num = n; }

        /// <summary>
        /// このインスタンスの数値を文字列に変換します．
        /// </summary>
        /// <returns>[0,<see cref="Mod"/>) の範囲内の整数を 10 進表記したもの．</returns>
        public override string ToString() => this.num.ToString();

        public static ModInt operator +(ModInt l, ModInt r)
        {
            l.num += r.num;
            if (l.num >= Mod)
            {
                l.num -= Mod;
            }
            return l;
        }

        public static ModInt operator -(ModInt l, ModInt r)
        {
            l.num -= r.num;
            if (l.num < 0)
            {
                l.num += Mod;
            }
            return l;
        }

        public static ModInt operator *(ModInt l, ModInt r) => new ModInt(l.num * r.num % Mod);

        public static implicit operator ModInt(long n)
        {
            n %= Mod; if (n < 0)
            {
                n += Mod;
            }
            return new ModInt(n);
        }

        /// <summary>
        /// 与えられた 2 つの数値からべき剰余を計算します．
        /// </summary>
        /// <param name="v">べき乗の底</param>
        /// <param name="k">べき指数</param>
        /// <returns>繰り返し二乗法により O(N log N) で実行されます．</returns>
        public static ModInt Pow(ModInt v, long k) => Pow(v.num, k);

        /// <summary>
        /// 与えられた 2 つの数値からべき剰余を計算します．
        /// </summary>
        /// <param name="v">べき乗の底</param>
        /// <param name="k">べき指数</param>
        /// <returns>繰り返し二乗法により O(N log N) で実行されます．</returns>
        public static ModInt Pow(long v, long k)
        {
            long ret = 1;
            for (k %= Mod - 1; k > 0; k >>= 1, v = v * v % Mod)
            {
                if ((k & 1) == 1)
                {
                    ret = ret * v % Mod;
                }
            }
            return new ModInt(ret);
        }

        /// <summary>
        /// 与えられた数の逆元を計算します．
        /// </summary>
        /// <param name="v">逆元を取る対象となる数</param>
        /// <returns>逆元となるような値</returns>
        /// <remarks>法が素数であることを仮定して，フェルマーの小定理に従って逆元を O(log N) で計算します．</remarks>
        public static ModInt Inverse(ModInt v) => Pow(v, Mod - 2);
    }
    #endregion

    #region Binomial Coefficient
    /// <summary>
    /// 二項係数
    /// </summary>
    public class BinomialCoefficient
    {
        private ModInt[] _Fact, _Ifact;

        /// <summary>
        /// 構築します。
        /// </summary>
        /// <param name="nMax">
        /// 多重集合の場合、n + k - 1を指定してください。
        /// </param>
        public BinomialCoefficient(int nMax)
        {
            this._Fact = new ModInt[nMax + 1];
            this._Ifact = new ModInt[nMax + 1];
            this._Fact[0] = 1;
            for (var i = 1; i <= nMax; i++)
            {
                this._Fact[i] = this._Fact[i - 1] * i; // i * (i - 1) * ... * 2 * 1
            }

            this._Ifact[nMax] = ModInt.Inverse(this._Fact[nMax]);
            for (var i = nMax - 1; i >= 0; i--)
            {
                this._Ifact[i] = this._Ifact[i + 1] * (i + 1); // 1 / ( 1 * 2 * ... *  (i - 1) * i )

            }

            this._Ifact[0] = this._Ifact[1];
        }

        /// <summary>
        /// 組み合わせの数を返します
        /// </summary>
        public ModInt GetCombination(int n, int r)
        {
            if (n < 0 || n >= this._Fact.Length || r < 0 || r > n)
            {
                return 0;
            }

            return this._Fact[n] * this._Ifact[n - r] * this._Ifact[r];
        }

        /// <summary>
        /// 多重係数(多重集合)を返します
        /// </summary>
        public ModInt GetRepeatedCombination(int n, int k)
        {
            if (k == 0)
            {
                return 1;
            }

            return this.GetCombination(n + k - 1, k);
        }
    }
    #endregion
        #region String Scanner

        public class Scanner
        {
            private const char Separator = ' ';
            private readonly StreamReader _Stream = new StreamReader(Console.OpenStandardInput());
            private int _Pos;
            private string[] _Line = new string[0];

            #region get a element

            public string GetNext()
            {
                // ReSharper disable once InvertIf
                if (this._Pos >= this._Line.Length)
                {
                    // ReSharper disable once PossibleNullReferenceException
                    this._Line = this._Stream.ReadLine().Split(Separator);
                    this._Pos = 0;
                }

                return this._Line[this._Pos++];
            }

            public int GetNextAsInt()
            {
                return int.Parse(this.GetNext());
            }

            public long GetNextAsLong()
            {
                return long.Parse(this.GetNext());
            }

            public double GetNextAsDouble()
            {
                return double.Parse(this.GetNext());
            }

            #endregion

            #region get array

            public string[] ToArrayFromNextLine()
            {
                if (this._Pos >= this._Line.Length)
                {
                    // ReSharper disable once PossibleNullReferenceException
                    this._Line = this._Stream.ReadLine().Split(Separator);
                }

                this._Pos = this._Line.Length;
                return this._Line;
            }

            public int[] ToIntArrayFromNextLine()
            {
                return ToIntArray(this.ToArrayFromNextLine());
            }

            public long[] ToLongArrayFromNextLine()
            {
                return ToLongArray(this.ToArrayFromNextLine());
            }

            public double[] ToDoubleArrayFromNextLine()
            {
                return ToDoubleArray(this.ToArrayFromNextLine());
            }

            #endregion

            #region convert array

            private static int[] ToIntArray(string[] array)
            {
                var result = new int[array.Length];
                for (var i = 0; i < array.Length; i++)
                {
                    result[i] = int.Parse(array[i]);
                }

                return result;
            }

            private static long[] ToLongArray(string[] array)
            {
                var result = new long[array.Length];
                for (var i = 0; i < array.Length; i++)
                {
                    result[i] = long.Parse(array[i]);
                }

                return result;
            }

            private static double[] ToDoubleArray(string[] array)
            {
                var result = new double[array.Length];
                for (var i = 0; i < array.Length; i++)
                {
                    result[i] = double.Parse(array[i]);
                }

                return result;
            }

            #endregion
        }

        #endregion
    }
}


Measured memory_bytes: 59872