{"problem":{"name":"Small Products","description":{"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$.","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc132_f"},"statements":[{"statement_type":"Markdown","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$.\n\n## Constraints\n\n*   $1\\leq N\\leq 10^9$\n*   1 $2\\leq K\\leq 100$ (fixed at 21:33 JST)\n*   $N$ and $K$ are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc132_f","tags":[],"sample_group":[["3 2","5\n\n$(1,1)$, $(1,2)$, $(1,3)$, $(2,1)$, and $(3,1)$ satisfy the condition."],["10 3","147"],["314159265 35","457397712"]],"created_at":"2026-03-03 11:01:14"}}