시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2 초 256 MB 3 1 1 33.333%

## 문제

Given two integers $V$ and $E$, we say that an array $A$ of length $E$ is a valid connectivity history array (CHA, for short) if there exists a directed graph with $V$ vertices and $E$ edges and a permutation $P$ of length $E$ such that, if we were to start with an empty graph on $V$ vertices and add edges in the order given by permutation $P$, then it is true for all $1 \le i \le E$ that $A[i]$ is the number of strongly connected components in the graph after adding the $P[i]$-th edge.

For example, for $V = 3$ and $E = 3$:

$A = [3, 3, 3]$ is a valid CHA because there exists the graph $\{(1, 2), (1, 3), (2, 3)\}$. Regardless of the edge order chosen, the graph will always have three strongly connected components.

$A = [3, 3, 1]$ is a valid CHA because there exists the graph $\{(1, 2), (2, 3), (3, 1)\}$. If we add the edges in exactly this order, the graph will have three strongly connected components after the first two edges, and a single strongly connected component after the third edge is added.

$A = [3, 2, 1]$ is not a valid CHA because there does not exist a graph with three edges on three vertices and an order of adding edges such that the number of strongly connected components decreases after each added edge.

Note that the graph is not allowed to contain self-loops or multiple edges (but if the edge $(x, y)$ exists, the edge $(y, x)$ may also exist).

You are given $Q$ queries, each consisting of a pair of integers $(V, \mathit{MAX})$. Your task is to count the number of valid CHAs for each pair $(V, E)$ such that $1 \le E \le \mathit{MAX}$.

## 입력

The first line contains a single integer $Q$, the number of queries ($Q \le 10$). In the next $Q$ lines, the $i$-th line describes the $i$-th query and contains three integers $V_i$, $\mathit{MAX}_i$ and $\mathit{MOD}_i$ ($1 \le V_i \le 50$, $1 \le \mathit{MAX}_i \le V \cdot (V - 1)$, $1 \le \mathit{MOD_i} \le 10^9$).

## 출력

Output $Q$ lines, one line per query. The $i$-th line must contain $\mathit{MAX}_i$ integers denoting the answers for the $i$-th query, taken modulo $\mathit{MOD}_i$. The $j$-th integer on the $i$-th line must denote the number of valid CHAs for the pair $(V_i, j)$.

## 예제 입력 1

2
5 10 666013
6 9 10


## 예제 출력 1

1 2 4 9 21 50 110 209 351 546
1 2 4 9 1 1 6 0 7