Background

Problem Description

Construct an integer sequence $a$ of length $m$ such that for all $1 \leq i \leq m$, $a_i \in [1, n]$.

Take its prefix $\gcd$, and record it as an integer sequence $b$.

The value $f(n, m, k)$ is the number of distinct sequences $b$ that can be constructed in the above way, such that in $b$, the number of times adjacent terms are equal is $\leq k$.

Given positive integers $n, m$, Little L asks you to compute the value of $\displaystyle\sum_{i = 1}^n \sum_{j = 1}^m \sum_{k = 0}^{j - 1} f(\lfloor \frac{n}{i} \rfloor, j, k)$.

Since the result may be very large, you only need to output the value modulo $2^{32}$.

Input Format

One line with two integers $n, m$.

Output Format

One line with one integer, representing the required value.

4 2

26

Hint

For $100\%$ of the testdata, $1 \leq n \leq 10^{10}$ and $1 \leq m \leq 34$.

Translated by ChatGPT 5