시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 2048 MB80462252.381%

문제

You are given two integers, $N$ and $K$. Determine the number of sequences of integers $(A_1, A_2, \dots , A_N )$ that satisfy

  • $1 ≤ A_i ≤ i$ for $1 ≤ i ≤ N$, and
  • $A_1 + A_2 + \cdots + A_N = K$.

Since the answer can be very large, calculate the answer modulo $998\, 244\, 353$.

입력

Input consists of two integers $N$ $K$ ($1 ≤ N ≤ 100\, 000$; $N ≤ K ≤ 200\, 000$).

출력

Output in a line an integer representing the answer modulo $998\, 244\, 353$.

예제 입력 1

3 5

예제 출력 1

2

The sequences that satisfy the requirements are $(1, 1, 3)$ and $(1, 2, 2)$.

예제 입력 2

5 6

예제 출력 2

4

The sequences that satisfy the requirements are: $(1, 1, 1, 1, 2)$, $(1, 1, 1, 2, 1)$, $(1, 1, 2, 1, 1)$, and $(1, 2, 1, 1, 1)$.

예제 입력 3

7 7

예제 출력 3

1

The only sequence that satisfy the requirements is $(1, 1, 1, 1, 1, 1, 1)$.

예제 입력 4

1 2

예제 출력 4

0

There are no sequences that satisfy the requirements.

예제 입력 5

19014 86712

예제 출력 5

270258410