B'There are n computers in the company network. They are numbered from 1 to n . For each pair of two computers 1 <= q i < j <= q n you know the value a_{i,j} : the difficulty of sending data between computers i and j . All values a_{i,j} for i<j are different. You want to separate all computers into k sets A_1, A_2, ldots, A_k , such that the following conditions are satisfied: For each 1 <= q k <= q n find the number of ways to divide computers into k groups, such that all required conditions are satisfied. These values can be large, so you need to find them by modulo 998 ,244 ,353 . The first line contains a single integer n ( 1 <= q n <= q 1500 ): the number of computers. The i -th of the next n lines contains n integers a_{i,1}, a_{i,2}, ldots, a_{i,n} ( 0 <= q a_{i,j} <= q frac{n (n-1)}{2} ). It is guaranteed that: Print n integers: the k -th of them should be equal to the number of possible ways to divide computers into k groups, such that all required conditions are satisfied, modulo 998 ,244 ,353 . Here are all possible ways to separate all computers into 4 groups in the second example: '...