A tavern has musicians. At the beginning every musician knows exactly one song, and all songs are different.
After each evening's performance the innkeeper picks a musician uniformly at random among all musicians, and then a musician uniformly at random among the other n - 1 musicians, so b \ne a. Musician forgets the song they know and learns the song that musician knows at that moment. All choices are independent. Thus every musician always knows exactly one song, although several musicians may know the same song.
Find the expected number of different songs known by the musicians after evenings.
The only line contains two integers and (2 \le n \le 100, 0 \le k \le 10^{18}) — the number of musicians and the number of evenings.
Print one integer. It can be shown that the expected value is a rational number \frac{p}{q}, where is not divisible by . Print p \cdot q^{-1} \bmod 998\,244\,353, that is, the integer such that 0 \le x < 998\,244\,353 and x \cdot q \equiv p \pmod{998\,244\,353}.
Example 1
Example 2
Example 3
Example 4
In the first example, n = 4 and k = 2. After the first evening two of the four musicians know the same song, and each of the other two knows a song of their own, so there are songs. On the second evening, if is one of the two musicians who know a song of their own, that song is lost and songs remain; otherwise songs remain. Each of these cases happens with probability \frac{2}{4}, so the expected number of songs is \frac{1}{2} \cdot 2 + \frac{1}{2} \cdot 3 = \frac{5}{2}, and 499\,122\,179 \cdot 2 \equiv 5 \pmod{998\,244\,353}. The figure shows one possible first evening (a = 2, b = 1; each circle shows the song of a musician, the musicians are numbered above) and both kinds of outcomes of the second evening; the numbers below and on the right are the numbers of different songs.
In the second example, n = 6 and k = 1. On the first evening musician replaces their song by a different one, so exactly one song is lost and songs remain.
In the third example, n = 2. After the first evening both musicians know the same song, and from then on exactly song is known.
In the fourth example, k = 0, so all songs are still known.