Maija has bought herself a bag of skittles (colored candy pebbles). As she munches on the candies, she wonders how many different bag contents there can be. Each bag contains between $a$ and $b$ skittles that come in $n$ different colors.

Input

A single line contains three integers $n,\,a$ and $b$.

Output

Print the number of different bags modulo $998244353$.

Constraints

• $1 \leq n \leq 10^5$
• $1 \leq a \leq b \leq 10^5$

Example 1

Input:

1 1 10

Output:

10

Example 2

Input:

2 4 5

Output:

11

Example 3

Input:

18558 38661 75914

Output:

924425479