#include <bits/stdc++.h>
using namespace std;
int n, m, k, a, b;
vector<int> v[300000 + 5], path, leaf, temp;
vector<int> cycle[300000 + 5];
bool isPath;
int visited[300000 + 5], curCycle;
void dfs(int now, int last, int depth) {
  if (visited[now]) return;
  visited[now] = depth;
  temp.push_back(now);
  if (depth > n / k) {
    isPath = true;
    path = temp;
    temp.pop_back();
    return;
  }
  bool isLeaves = true;
  for (int i = 0; i < v[now].size(); i++) {
    int tg = v[now][i];
    if (tg == last) continue;
    if (!visited[tg]) {
      dfs(tg, now, depth + 1);
      isLeaves = false;
    }
  }
  if (isLeaves) {
    vector<int> ancestor;
    bool findCycle = false;
    for (int i = 0; i < v[now].size(); i++) {
      int tg = v[now][i];
      if (tg == last) continue;
      if ((depth - visited[tg]) % 3 != 2) {
        findCycle = true;
        for (int i = depth - 1; i >= visited[tg] - 1; i--) {
          cycle[curCycle].push_back(temp[i]);
        }
        break;
      } else {
        ancestor.push_back(visited[tg]);
      }
    }
    if (!findCycle) {
      cycle[curCycle].push_back(now);
      sort(ancestor.begin(), ancestor.end());
      for (int i = ancestor[0] - 1; i < ancestor[1]; i++) {
        cycle[curCycle].push_back(temp[i]);
      }
    }
    curCycle++;
  }
  temp.pop_back();
}
int main() {
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 0; i < m; i++) {
    scanf("%d %d", &a, &b);
    a--;
    b--;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  dfs(0, 0, 1);
  if (isPath) {
    printf("PATH\n");
    printf("%d\n", path.size());
    for (int i = 0; i < path.size(); i++) {
      printf("%d", path[i] + 1);
      if (i == path.size() - 1)
        printf("\n");
      else
        printf(" ");
    }
  } else {
    printf("CYCLES\n");
    for (int i = 0; i < k; i++) {
      printf("%d\n", cycle[i].size());
      for (int j = 0; j < cycle[i].size(); j++) {
        printf("%d", cycle[i][j] + 1);
        if (j == cycle[i].size() - 1)
          printf("\n");
        else
          printf(" ");
      }
    }
  }
}
