require 'prime'

class Integer
  def divisor_list
    require 'prime'

    return [] if self <= 0
    return [1] if self == 1

    prime_division.map.with_index { |(base, k), i|
      s = i.zero? ? 0 : 1
      (s..k).map { |n| base ** n }
    }.inject { |res, e| res + res.flat_map { |t| e.map { |v| t * v } } }.sort
  end
end

N, K = gets.split.map(&:to_i)
MOD = 10 ** 9 + 7

cache = []
nums = N.divisor_list
cache = Hash.new

nums.each do |n|
  cache[n] = n.divisor_list
end

dp = Hash.new(0)
dp[N] = 1

K.times do |i|
  temp = Hash.new(0)

  nums.each do |n|
    cache[n].each do |e, _cnt|
      nv = n / e
      temp[nv] += dp[n]
      temp[nv] %= MOD
    end
  end

  dp = temp
end

puts dp.values.sum % MOD