Chains of Multiples

Minho wants to build a sequence of length $L$ using integers from 1 to $N$. With no restriction the count would be $N^L$.

Minho finds such sequences dull, so he builds only the sequences that obey both rules below.

1. The sequence is non-decreasing. An earlier term is never greater than a later term.
2. For any two positions in the sequence, one of the two values is a multiple of the other.

Count the sequences that obey both rules. The count can grow very large, so report it modulo $10^9 + 7$.

The first line contains $N$ and $L$, separated by a single space. ($1 \le N, L \le 2000$)

Print the number of sequences that obey both rules, modulo $10^9 + 7$, on one line.