#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 10;
int to[maxn << 1], nxt[maxn << 1], head[maxn], cnt;
void add(int u, int v) {
  ++cnt, to[cnt] = v, nxt[cnt] = head[u], head[u] = cnt;
  ++cnt, to[cnt] = u, nxt[cnt] = head[v], head[v] = cnt;
}
int n, m, k, now = 0, maxs = 0, pos = 0;
int dep[maxn], fa[maxn], leaf[maxn];
vector<int> ans[maxn];
void dfs(int u) {
  leaf[u] = 1, dep[u] = dep[fa[u]] + 1;
  if (dep[u] > maxs) maxs = dep[u], pos = u;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (v == fa[u]) continue;
    if (dep[v]) continue;
    leaf[u] = 0;
    fa[v] = u;
    dfs(v);
  }
}
int main() {
  cnt = 0;
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1, u, v; i <= m; i++) {
    scanf("%d%d", &u, &v);
    add(u, v);
  }
  dfs(1);
  if (maxs >= n / k) {
    printf("PATH\n%d\n", maxs);
    while (pos) {
      printf("%d ", pos);
      pos = fa[pos];
    }
  } else {
    printf("CYCLES\n");
    for (int i = 1; i <= n && k; i++) {
      if (!leaf[i]) continue;
      int x = 0, y = 0;
      k--;
      for (int j = head[i]; j; j = nxt[j]) {
        int v = to[j];
        if (v == fa[i]) continue;
        if (!x)
          x = v;
        else {
          y = v;
          break;
        }
      }
      if (dep[x] < dep[y]) swap(x, y);
      if ((dep[i] - dep[x] + 1) % 3) {
        printf("%d\n", dep[i] - dep[x] + 1);
        int u = i;
        printf("%d ", u);
        while (u != x) {
          u = fa[u];
          printf("%d ", u);
        }
        printf("\n");
      } else if ((dep[i] - dep[y] + 1) % 3) {
        printf("%d\n", dep[i] - dep[y] + 1);
        int u = i;
        printf("%d ", u);
        while (u != y) {
          u = fa[u];
          printf("%d ", u);
        }
        printf("\n");
      } else if ((dep[x] - dep[y] + 2) % 3) {
        printf("%d\n", dep[x] - dep[y] + 2);
        printf("%d ", i);
        int u = x;
        printf("%d ", u);
        while (u != y) {
          u = fa[u];
          printf("%d ", u);
        }
        printf("\n");
      }
    }
  }
}
