Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Johnny Solving

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputToday is tuesday, that means there is a dispute in JOHNNY SOLVING team again: they try to understand who is Johnny and who is Solving. That's why guys asked Umnik to help them. Umnik gave guys a connected graph with $$$n$$$ vertices without loops and multiedges, such that a degree of any vertex is at least $$$3$$$, and also he gave a number $$$1 \leq k \leq n$$$. Because Johnny is not too smart, he promised to find a simple path with length at least $$$\frac{n}{k}$$$ in the graph. In reply, Solving promised to find $$$k$$$ simple by vertices cycles with representatives, such that:

- Length of each cycle is at least $$$3$$$.
- Length of each cycle is not divisible by $$$3$$$.
- In each cycle must be a representative - vertex, which belongs only to this cycle among all printed cycles.

You need to help guys resolve the dispute, for that you need to find a solution for Johnny: a simple path with length at least $$$\frac{n}{k}$$$ ($$$n$$$ is not necessarily divided by $$$k$$$), or solution for Solving: $$$k$$$ cycles that satisfy all the conditions above. If there is no any solution - print $$$-1$$$.

Input

The first line contains three integers $$$n$$$, $$$m$$$ and $$$k$$$ ($$$1 \leq k \leq n \leq 2.5 \cdot 10^5, 1 \leq m \leq 5 \cdot 10^5$$$)

Next $$$m$$$ lines describe edges of the graph in format $$$v$$$, $$$u$$$ ($$$1 \leq v, u \leq n$$$). It's guaranteed that $$$v \neq u$$$ and all $$$m$$$ pairs are distinct.

It's guaranteed that a degree of each vertex is at least $$$3$$$.

Output

Print PATH in the first line, if you solve problem for Johnny. In the second line print the number of vertices in the path $$$c$$$ ($$$c \geq \frac{n}{k}$$$). And in the third line print vertices describing the path in route order.

Print CYCLES in the first line, if you solve problem for Solving. In the following lines describe exactly $$$k$$$ cycles in the following format: in the first line print the size of the cycle $$$c$$$ ($$$c \geq 3$$$). In the second line print the cycle in route order. Also, the first vertex in the cycle must be a representative.

Print $$$-1$$$ if there is no any solution. The total amount of printed numbers in the output must be at most $$$10^6$$$. It's guaranteed, that if exists any solution then there is a correct output satisfies this restriction.

Examples

Input

4 6 2 1 2 1 3 1 4 2 3 2 4 3 4

Output

PATH 4 1 2 3 4

Input

10 18 2 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 2 3 3 4 2 4 5 6 6 7 5 7 8 9 9 10 8 10

Output

CYCLES 4 4 1 2 3 4 7 1 5 6

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/20/2021 07:19:54 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|