Problem Description

Recently Vasya learned about integer division. Inspired by this sacred knowledge, he decided to learn more about arrays of positive integers which satisfy some divisibility conditions. More precisely, Vasya calls an array $a=\{a_1,a_2,\ldots,a_n\}$ $\textit{good}$ iff for every $i$ from $1$ to $n-1$, $a_i$ is divisible by $a_{i+1}$. Please help him count the number of good arrays of length $n$ consisting of integer numbers not greater than $c$.

Input Format

The only input line contains two integers $n$ and $c$ ($1 \le n, c \le 5 \cdot 10^7$) --- the length of the array and the maximum allowed value.

Output Format

Output a single integer --- the total number of good arrays of length $n$ consisting of positive integers not greater than $c$. As this number might be quite large, please output its remainder modulo $998\,244\,353$.

3 3

7

2 6

14

Hint

The testset for this problem consists of 7 test groups. You get points for a group only if your solution passes all tests from this group and from all the required groups.

$\textbf{Offline-evaluation}$ means that you will not get immediate feedback for this group and you will be able to see the outcome only after the end of the competition.