Problem Statement

Magical Sequences Given integers `A` and `B`, count sequences `b1, b2, ..., bB` such that `1 <= b1 <= b2 <= ... <= bB <= A` and every element divides the next one: `bi` divides `b(i+1)`. Print the answer modulo `1000000007`. Input Format The input contains two integers `A` and `B`. Output Format Print the number of magical sequences modulo `1000000007`. Constraints - `1 <= A, B <= 2000` Examples ### Example 1 Input ``` 3 2 ``` Output ``` 5 ``` The sequences are `(1,1)`, `(1,2)`, `(1,3)`, `(2,2)`, and `(3,3)`. Notes - Divisibility is inclusive: every positive integer divides itself. - The supplied source did not specify a stdin layout; this page uses `A B` on one line.