#include <bits/stdc++.h>
using namespace std;
const int maxn = 300001;
vector<int> adj[maxn];
int prt[maxn];
int dep[maxn];
bool leaf[maxn];
int c;
int n, m, k;
void dfs(int u);
void find(int u);
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  dep[1] = 1;
  dfs(1);
  for (int i = 1; i <= n; i++) {
    if (dep[i] >= ceil((double)n / k)) {
      int cur = i;
      printf("PATH\n%d\n", dep[i]);
      do {
        printf("%d ", cur);
        cur = prt[cur];
      } while (cur);
      return 0;
    }
  }
  printf("CYCLES\n");
  find(1);
  return 0;
}
void dfs(int u) {
  leaf[u] = 1;
  for (int i = 0; i < adj[u].size(); i++) {
    int v = adj[u][i];
    if (dep[v]) continue;
    leaf[u] = 0;
    prt[v] = u;
    dep[v] = dep[u] + 1;
    dfs(v);
  }
}
void find(int u) {
  if (leaf[u]) {
    int cnt = 0;
    int x, y;
    for (int i = 0; i < adj[u].size(); i++) {
      int v = adj[u][i];
      if (v == prt[u]) continue;
      (cnt++ ? y : x) = v;
    }
    if ((dep[u] - dep[x] + 1) % 3) {
      int cur = u;
      printf("%d\n", dep[u] - dep[x] + 1);
      while (cur != x) {
        printf("%d ", cur);
        cur = prt[cur];
      }
      printf("%d\n", x);
    } else if ((dep[u] - dep[y] + 1) % 3) {
      int cur = u;
      printf("%d\n", dep[u] - dep[y] + 1);
      while (cur != y) {
        printf("%d ", cur);
        cur = prt[cur];
      }
      printf("%d\n", y);
    } else {
      if (dep[x] < dep[y]) swap(x, y);
      printf("%d\n", dep[x] - dep[y] + 2);
      int cur = x;
      while (cur != y) {
        printf("%d ", cur);
        cur = prt[cur];
      }
      printf("%d %d\n", y, u);
    }
    c++;
    if (c == k) exit(0);
  }
  for (int i = 0; i < adj[u].size(); i++) {
    int v = adj[u][i];
    if (u != prt[v]) continue;
    find(v);
  }
}
