#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "URDL";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 998244353) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 998244353) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
vector<int> mp[250135], mp1[250135], lf;
int d[250135], p[250135];
void build(int x, int pa) {
  d[x] = d[pa] + 1;
  p[x] = pa;
  bool fg = 0;
  for (int c : mp[x])
    if (c != pa && d[c] == 0) {
      build(c, x);
      fg = 1;
    }
  if (!fg) lf.push_back(x);
}
void fmain(int tid) {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 0, u, v; i < m; i++) {
    scanf("%d%d", &u, &v);
    mp[u].push_back(v);
    mp[v].push_back(u);
  };
  build(1, 0);
  for (int(i) = 1; (i) <= (int)(n); (i)++)
    if ((long long)d[i] * k >= n) {
      puts("PATH");
      printf("%d\n", d[i]);
      int x = i;
      while (x) {
        printf("%d ", x);
        x = p[x];
      }
      return;
    }
  puts("CYCLES");
  for (int(i) = 0; (i) < (int)(k); (i)++) {
    int v = lf[i];
    vector<int> x(2, -1);
    for (int c : mp[v])
      if (c != p[v]) {
        if (x[0] == -1)
          x[0] = c;
        else if (x[1] == -1)
          x[1] = c;
        else
          break;
      }
    bool ok = 0;
    for (int(j) = 0; (j) < (int)(2); (j)++) {
      if ((d[v] - d[x[j]] + 1) % 3 != 0) {
        printf("%d\n", d[v] - d[x[j]] + 1);
        for (int z = v;; z = p[z]) {
          printf("%d ", z);
          if (z == x[j]) break;
        }
        puts("");
        ok = 1;
        break;
      }
    }
    if (ok) continue;
    if (d[x[0]] < d[x[1]]) swap(x[0], x[1]);
    int len = d[x[0]] - d[x[1]] + 2;
    printf("%d\n", len);
    printf("%d ", v);
    for (int z = x[0];; z = p[z]) {
      printf("%d ", z);
      if (z == x[1]) break;
    }
    puts("");
  }
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
