B"Suppose you have an integer array a_1, a_2, ... , a_n . Let operatorname{lsl}(i) be the number of indices j ( 1 <= j < i ) such that a_j < a_i . Analogically, let operatorname{grr}(i) be the number of indices j ( i < j <= n ) such that a_j > a_i . Let's name position i good in the array a if operatorname{lsl}(i) < operatorname{grr}(i) . Finally, let's define a function f on array a f(a) as the sum of all a_i such that i is good in a . Given two integers n and k , find the sum of f(a) over all arrays a of size n such that 1 <= q a_i <= q k for all 1 <= q i <= q n modulo 998 ,244 ,353 . The first and only line contains two integers n and k ( 1 <= q n <= q 50 ; 2 <= q k < 998 ,244 ,353 ). Output a single integer -- the sum of f over all arrays a of size n modulo 998 ,244 ,353 . In the first test case: Adding up all of these values, we get 28 as the answer. "...