#include <bits/stdc++.h>
using namespace std;
const int N = 250000 + 10;
const int M = 1000000 + 10;
int n, m, k, a, b;
int head[N], nxt[M], to[M], tot;
int root, dep[N], fa[N], leaf[N], cnt;
int maxd, u;
bool vis[N];
void add(int x, int y) {
  to[++tot] = y;
  nxt[tot] = head[x];
  head[x] = tot;
}
int up(int x, int y) {
  int p = x / y;
  if (x % y == 0)
    return p;
  else
    return p + 1;
}
void dfs(int x) {
  vis[x] = true;
  int t = 0;
  for (int i = head[x]; i; i = nxt[i]) {
    int y = to[i];
    if (vis[y]) continue;
    t++;
    fa[y] = x;
    dep[y] = dep[x] + 1;
    dfs(y);
  }
  if (t == 0) {
    leaf[++cnt] = x;
    if (maxd < dep[x]) {
      maxd = dep[x];
      u = x;
    }
  }
  return;
}
bool cmp(int x, int y) { return dep[x] < dep[y]; }
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= m; ++i) {
    scanf("%d%d", &a, &b);
    add(a, b);
    add(b, a);
  }
  root = 1;
  dep[root] = 1;
  dfs(root);
  if (maxd >= up(n, k)) {
    printf("PATH\n");
    printf("%d\n", maxd);
    while (u != root) {
      printf("%d ", u);
      u = fa[u];
    }
    printf("%d", root);
  } else {
    printf("CYCLES\n");
    for (int i = 1; i <= k; ++i) {
      int x = leaf[i];
      int dp, dq, p = 0, q = 0;
      for (int j = head[x]; j; j = nxt[j]) {
        if (to[j] == fa[x]) continue;
        if (!p)
          p = to[j], dp = dep[x] - dep[to[j]] + 1;
        else if (!q) {
          q = to[j], dq = dep[x] - dep[to[j]] + 1;
          break;
        }
      }
      if (dp % 3 != 0) {
        printf("%d\n", dp);
        while (x != p) {
          printf("%d ", x);
          x = fa[x];
        }
        printf("%d\n", x);
      } else if (dq % 3 != 0) {
        printf("%d\n", dq);
        while (x != q) {
          printf("%d ", x);
          x = fa[x];
        }
        printf("%d\n", x);
      } else {
        if (dep[p] < dep[q]) {
          swap(p, q);
          swap(dp, dq);
        }
        printf("%d\n", dq - dp + 2);
        printf("%d ", x);
        while (p != q) {
          printf("%d ", p);
          p = fa[p];
        }
        printf("%d\n", p);
      }
    }
  }
  return 0;
}
