Nice Numbers

In positional base-$d$ notation, an integer $K = (A\_1 A\_2 \ldots A\_m)\_d$ (where $A\_i \in \[0, d)$ and $A\_1 \neq 0$) is called \textit{good} if and only if $A\_1, \ldots, A\_m$ is a permutation of integers from $0$ to $d - 1$.

A number $K$ is \textit{nice} if and only if there exists at least one $d \geq 2$ such that $K$ is good in positional base-$d$ notation.

Calculate the number of nice numbers in the interval $\[L, R]$. As the answer may be very large, find it modulo $998\\,244\\,353$.

The first line of the input contains two integers $L$ and $R$ ($1 \leq L \leq R \leq 10^{5000}$).

Print a single line with a single integer: the answer modulo $998\\,244\\,353$.