The grader outputs the results of the function \texttt{solve} --- the list of found pieces.

In the first line, the number of found polygons (the size of the vector returned by the function \texttt{solve}) is printed.

In the following lines for each polygon (an element in the vector returned by the function \texttt{solve}), the size of the polygon is printed first, followed by the line of indices of the candles that are the vertices of the polygon (elements of each \texttt{std::vector<int>} in the return value of the function \texttt{solve}). Each polygon must be convex, and its vertices must be listed in the order of traversal (either clockwise or counterclockwise). No two polygons should intersect at internal points.

In the file \texttt{grader.cpp}, there is a variable \texttt{verbose}, which is initially set to $0$. By increasing its value, the grader will write more detailed information about your solution and its requests.