{"raw_statement":[{"iden":"problem statement","content":"Find the number of sequences of length $K$ consisting of positive integers such that the product of any two adjacent elements is at most $N$, modulo $10^9+7$."},{"iden":"constraints","content":"*   $1\\leq N\\leq 10^9$\n*   1 $2\\leq K\\leq 100$ (fixed at 21:33 JST)\n*   $N$ and $K$ are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$"},{"iden":"sample input 1","content":"3 2"},{"iden":"sample output 1","content":"5\n\n$(1,1)$, $(1,2)$, $(1,3)$, $(2,1)$, and $(3,1)$ satisfy the condition."},{"iden":"sample input 2","content":"10 3"},{"iden":"sample output 2","content":"147"},{"iden":"sample input 3","content":"314159265 35"},{"iden":"sample output 3","content":"457397712"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}