#include <bits/stdc++.h>
using namespace std;
const int maxn = 260000;
vector<int> G[maxn], back[maxn], leaf;
int n, m, k, len, fa[maxn], vis[maxn], dep[maxn], sz[maxn];
int mxdep = 0, vertex = -1;
bool solve = false;
void dfs(int v, int fath, int depth) {
  fa[v] = fath, vis[v] = true, dep[v] = depth, sz[v] = 1;
  if (depth > mxdep) mxdep = depth, vertex = v;
  for (auto u : G[v]) {
    if (u == fath) continue;
    if (vis[u]) {
      back[v].push_back(u);
      continue;
    }
    dfs(u, v, depth + 1);
    sz[v] += sz[u];
  }
  if (sz[v] == 1) leaf.push_back(v);
}
int main() {
  scanf("%d%d%d", &n, &m, &k);
  len = n / k;
  for (int i = 1; i <= m; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    G[x].push_back(y);
    G[y].push_back(x);
  }
  dfs(1, -1, 1);
  if (mxdep >= len) {
    puts("PATH");
    int cur = vertex;
    printf("%d\n%d", mxdep, cur);
    while (cur != 1) {
      cur = fa[cur];
      printf(" %d", cur);
    }
    return 0;
  } else {
    puts("CYCLES");
    int cnt = k;
    for (int i = 0; i < cnt; ++i) {
      int v = leaf[i], anc[5];
      vector<int> cyc;
      cyc.push_back(v);
      anc[0] = back[v][0];
      anc[1] = back[v][1];
      if (dep[anc[0]] < dep[anc[1]]) swap(anc[0], anc[1]);
      auto get = [&](int tp, int goal) {
        while (tp != goal) {
          tp = fa[tp];
          cyc.push_back(tp);
        }
      };
      if ((dep[v] - dep[anc[0]] + 1) % 3 != 0)
        get(v, anc[0]);
      else if ((dep[v] - dep[anc[1]] + 1) % 3 != 0)
        get(v, anc[1]);
      else {
        cyc.push_back(anc[0]);
        get(anc[0], anc[1]);
      }
      int sz = cyc.size();
      printf("%d\n", sz);
      for (int j = 0; j < sz; ++j) printf("%d%c", cyc[j], " \n"[j == sz - 1]);
    }
  }
  return 0;
}
