시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 1024 MB200592518.797%

문제

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\}$ 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$.

입력

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 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$.

서브태스크

번호배점제한
115

$n \le 10$, $c \le 10$

214

$n \le 1000$, $c \le 1000$

312

$n \le 5000$, $c \le 5000$

416

$n \le 100\,000$, $c \le 100\,000$

514

$n \le 10^6$ & $c \le 10^6$

615

$n \le 10^7$, $c \le 10^7$

714

예제 입력 1

3 3

예제 출력 1

7

예제 입력 2

2 6

예제 출력 2

14

채점 및 기타 정보

  • 예제는 채점하지 않는다.
  • 이 문제의 채점 우선 순위는 2이다.