CF414B.Mashmokh and ACM

Mashmokh's boss, Bimokh, didn't like Mashmokh. So he fired him. Mashmokh decided to go to university and participate in ACM instead of finding a new job. He wants to become a member of Bamokh's team. In order to join he was given some programming tasks and one week to solve them. Mashmokh is not a very experienced programmer. Actually he is not a programmer at all. So he wasn't able to solve them. That's why he asked you to help him with these tasks. One of these tasks is the following.

A sequence of l integers _b_1, _b_2, ..., b__l (1 ≤ _b_1 ≤ _b_2 ≤ ... ≤ b__l ≤ n) is called good if each number divides (without a remainder) by the next number in the sequence. More formally for all i (1 ≤ i ≤ l - 1).

Given n and k find the number of good sequences of length k. As the answer can be rather large print it modulo 1000000007 (109 + 7).

马什莫赫的老板比莫赫不喜欢马什莫赫，因此解雇了他。马什莫赫决定进入大学并参加 ACM 竞赛，而不是另找工作。他希望成为巴莫赫（Bamokh）团队的一员。为了加入该团队，他被布置了一些编程任务，并有一周时间来解决它们。马什莫赫并不是一位经验丰富的程序员——事实上，他根本就不是程序员。因此他无法完成这些任务，于是请求你帮助他解决这些问题。其中一道题目如下：

一个长度为 $l$ 的整数序列 $b_1, b_2, \dots, b_l$（满足 $1 \leq b_1 \leq b_2 \leq \dots \leq b_l \leq n$）被称为“好序列”，当且仅当序列中每个数都能被其后一个数整除（即无余数）。更严格地讲，对所有 $i$（$1 \leq i \leq l-1$），需满足

给定 $n$ 和 $k$，求长度为 $k$ 的“好序列”的个数。由于答案可能非常大，请将结果对 $1000000007$（即 $10^9 + 7$）取模后输出。

The first line of input contains two space-separated integers n, k (1 ≤ n, k ≤ 2000).

输入的第一行包含两个以空格分隔的整数 $n$ 和 $k$（$1 ≤ n, k ≤ 2000$）。

Output a single integer — the number of good sequences of length k modulo 1000000007 (109 + 7).

输出一个整数——长度为 $k$ 的好序列的个数对 $1000000007$（即 $10^9 + 7$）取模的结果。

In the first sample the good sequences are: [1, 1], [2, 2], [3, 3], [1, 2], [1, 3].

在第一个样例中，好的序列有：[1, 1], [2, 2], [3, 3], [1, 2], [1, 3]。