using System;
using System.Collections.Generic;
using System.IO;
using System.Runtime.Remoting.Contexts;

namespace Contest
{
    class Program
    {
        private Scanner sc;
        private const int Mod = (int)1e9 + 7;
        public void Solve()
        {
            sc = new Scanner();
            int N = sc.NextInt();
            int K = sc.NextInt();
            List<int> divisor = new List<int>();
            List<int> divB = new List<int>();
            for (int i = 1; i * i <= N; i++)
            {
                divisor.Add(i);
                divB.Add(N / i);

            }

            for (int i = 0; i < divB.Count; i++)
            {
                divisor.Add(divB[divB.Count + ~i]);
            }

            int cnt = divisor.Count;

            //var dp = new long[K, N + 1];
            //for (int i = 0; i < K; i++)
            //{
            //    for (int j = 1; j <= N; j++)
            //    {
            //        if (i == 0)
            //        {
            //            dp[i, j] = 1;
            //        }
            //        else
            //        {
            //            long sum = 0;
            //            for (int k = 1; k * j <= N; k++)
            //            {
            //                sum += dp[i - 1, k];
            //            }

            //            dp[i, j] = sum;
            //        }
            //    }
            //}

            //long ans = 0;
            //for (int i = 1; i <= N; i++)
            //{
            //    ans += dp[K - 1, i];
            //}
            //Console.WriteLine(ans);

            var dp = new long[K, cnt];

            for (int i = 0; i < K; i++)
            {
                if (i == 0)
                {
                    for (int j = 0; j < cnt; j++)
                    {
                        dp[i, j] = 1;
                    }
                }
                else
                {
                    long sum = 0;
                    for (int j = 0; j < cnt; j++)
                    {
                        int rev = cnt + ~j;
                        long p = divisor[j];
                        if (j - 1 >= 0)
                        {
                            p -= divisor[j - 1];
                        }

                        sum += dp[i - 1, rev] * p;

                        sum %= Mod;

                        dp[i, j] = sum;
                    }
                }
            }

            long ans = 0;
            for (int i = 0; i < cnt; i++)
            {
                int rev = cnt + ~i;
                long p = divisor[rev];
                if (rev - 1 >= 0)
                {
                    p -= divisor[rev - 1];
                }
                // Console.WriteLine($"{divisor[i]} {p}");
                ans += dp[K - 1, i] * p;
                ans %= Mod;
            }
            Console.WriteLine(ans);
        }

        static void Main() => new Program().Solve();
    }
}

class Scanner
{
    public Scanner()
    {
        _stream = new StreamReader(Console.OpenStandardInput());
        _pos = 0;
        _line = new string[0];
        _separator = ' ';
    }
    private readonly char _separator;
    private readonly StreamReader _stream;
    private int _pos;
    private string[] _line;
    #region get a element
    public string Next()
    {
        if (_pos >= _line.Length)
        {
            _line = _stream.ReadLine().Split(_separator);
            _pos = 0;
        }
        return _line[_pos++];
    }
    public int NextInt()
    {
        return int.Parse(Next());
    }
    public long NextLong()
    {
        return long.Parse(Next());
    }
    public double NextDouble()
    {
        return double.Parse(Next());
    }
    #endregion
    #region convert array
    private int[] ToIntArray(string[] array)
    {
        var result = new int[array.Length];
        for (int i = 0; i < array.Length; i++)
        {
            result[i] = int.Parse(array[i]);
        }

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

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

        return result;
    }
    #endregion
    #region get array
    public string[] Array()
    {
        if (_pos >= _line.Length)
            _line = _stream.ReadLine().Split(_separator);
        _pos = _line.Length;
        return _line;
    }
    public int[] IntArray()
    {
        return ToIntArray(Array());
    }
    public long[] LongArray()
    {
        return ToLongArray(Array());
    }
    public double[] DoubleArray()
    {
        return ToDoubleArray(Array());
    }
    #endregion
}

Measured memory_bytes: 61152