CF414B.Mashmokh and ACM

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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$ $(10^{9}+7)$ .

输入格式

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

输出格式

Output a single integer — the number of good sequences of length $k$ modulo $1000000007$ $(10^{9}+7)$ .

输入输出样例

输入#1
```
3 2
```
输出#1
```
5
```
输入#2
```
6 4
```
输出#2
```
39
```
输入#3
```
2 1
```
输出#3
```
2
```

说明/提示

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

首页