// https://atcoder.jp/contests/abc132/tasks/abc132_f
//
#![allow(unused_imports)]
use std::io::*;
use std::io::Write;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

// Input macros.
// Original by tanakh: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };

    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, [ next / $t:tt ]) => {
        {
            let len = read_value!($iter, usize);
            (0..len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        }
    };

    ($iter:expr, switch) => {
        {
            let ty = read_value!($iter, i32);
            if ty == 1 {
                vec![ty, read_value!($iter, i32), read_value!($iter, i32)]
            } else if ty == 2 {
                vec![ty, read_value!($iter, i32)]
            } else {
                vec![ty, read_value!($iter, i32)]
            }
        }
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! read_line {
    ($t:tt) => {
        {
            let mut s = String::new();
            std::io::stdin().read_line(&mut s).unwrap();
            s.trim_right().parse::<$t>().unwrap()
        }
    }
}

#[allow(unused_macros)]
macro_rules! dvec {
    ($t:expr ; $len:expr) => {
        vec![$t; $len]
    };

    ($t:expr ; $len:expr, $($rest:expr),*) => {
        vec![dvec!($t; $($rest),*); $len]
    };
}

#[allow(unused_macros)]
macro_rules! ifv {
    ($t:expr, $a:expr, $b: expr) => {
        if $t { $a } else { $b }
    }
}

#[allow(unused_macros)]
macro_rules! fill {
    ($t:expr, $v:expr) => {
        for i in 0..$t.len() {
            $t[i] = $v;
        }
    };
}

#[allow(unused_macros)]
macro_rules! join {
    ($t:expr, $glue:expr) => {
        $t.into_iter().map(|w| w.to_string()).collect::<Vec<_>>().join($glue)
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

// ===

const MOD: i64 = 1e9 as i64 + 7;

fn main() {
    input! {
        n: i64, k: usize
    };

    let mut nums = vec![];
    if n <= 100 {
        for i in 1..n+1 {
            nums.push((i, i));
        }
    } else {
        for s in 1..n+1 {
            nums.push((s,s));
            if n/(s+1)+1 <= n/s {
                let lft = max(s+1, n/(s+1)+1);
                if lft <= n/s {
                    // debug!(lft, n/s);
                    nums.push((lft, n/s));
                }
            }
            if s > n/(s+1)+1 || s > n/s {
                break;
            }
        }
        nums.sort();
        nums.dedup();
    }

    let w = nums.len();
    for i in 0..w-1 {
        if nums[i].1 + 1 != nums[i+1].0 {
            nums[i+1].0 = nums[i].1 + 1;
        }
    }

    let mut upto = vec![0; w];

    for i in (0..w).rev() {
        let ma = nums[i].1;
        while upto[i] < w && nums[upto[i]].1 * ma <= n {
            upto[i] += 1;
        }
        if i >= 1 {
            upto[i-1] = upto[i];
        }
    }

    let mut dp = dvec!(0; k+1, w);
    dp[0][0] = 1;
    for i in 1..k+2 {
        let mut psum = vec![0; w+1];
        for j in 0..w {
            psum[j+1] = (psum[j] + dp[i-1][j]) % MOD;
        }
        if i == k+1 {
            println!("{}", psum[w]);
            return;
        }
        for j in 0..w {
            dp[i][j] = psum[upto[j]] * (nums[j].1 - nums[j].0 + 1) % MOD;
        }
    }
}


Measured memory_bytes: 76156