Your desk must route n orders to m trading venues. Every order is sent to exactly one venue.

Count the routings in which every venue receives at least one order. Since the count can be enormous, output it modulo 998244353.

Input

Two integers n and m.

Output

One integer: the number of routings that use every venue at least once, modulo 998244353. If no such routing exists, output 0.

Constraints

1 <= n <= 10^9

1 <= m <= 10^5

Scoring

This is a standard problem: a submission scores full points if it produces the correct output for every test case, and zero otherwise.