#include <bits/stdc++.h>
using namespace std;
namespace mine {
long long qread() {
  long long ans = 0, f = 1;
  char c = getchar();
  while (c < '0' or c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while ('0' <= c and c <= '9') ans = ans * 10 + c - '0', c = getchar();
  return ans * f;
}
void write(long long num) {
  if (num < 0) putchar('-'), num = -num;
  if (num >= 10) write(num / 10);
  putchar('0' + num % 10);
}
void write1(long long num) {
  write(num);
  putchar(' ');
}
void write2(long long num) {
  write(num);
  putchar('\n');
}
template <typename T>
inline bool chmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline bool chmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
bool IN(long long x, long long l, long long r) { return l <= x and x <= r; }
void GG() {
  puts("-1");
  exit(0);
}
const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
int mm(const int x) { return x >= MOD ? x - MOD : x; }
template <typename T>
void add(T &x, const int &y) {
  x = (x + y >= MOD ? x + y - MOD : x + y);
}
long long qpower(long long x, long long e, int mod = MOD) {
  long long ans = 1;
  while (e) {
    if (e & 1) ans = ans * x % mod;
    x = x * x % mod;
    e >>= 1;
  }
  return ans;
}
long long invm(long long x) { return qpower(x, MOD - 2); }
const int MM = 1e6 + 10;
long long fac[MM], facinv[MM], Inv[MM];
long long Comb(int n, int m) {
  return n < 0 or m < 0 or n < m
             ? 0
             : fac[n] * facinv[m] % MOD * facinv[n - m] % MOD;
}
void PRE() {
  fac[0] = 1;
  for (int i = (1), I = (MM - 1); i <= I; i++) fac[i] = fac[i - 1] * i % MOD;
  facinv[MM - 1] = invm(fac[MM - 1]);
  for (int i = (MM - 1), I = (1); i >= I; i--)
    facinv[i - 1] = facinv[i] * i % MOD;
  Inv[1] = 1;
  for (int i = (2), I = (MM - 1); i <= I; i++)
    Inv[i] = (MOD - MOD / i) * Inv[MOD % i] % MOD;
}
const int N = 3e5 + 10;
vector<int> to[N];
namespace Tr {
int dep[N], in[N], out[N], dfnid, ff[N][21];
void pre(int x, int fa = 0) {
  in[x] = ++dfnid, dep[x] = dep[fa] + 1;
  ff[x][0] = fa;
  for (int i = (1), I = (20); i <= I; i++) ff[x][i] = ff[ff[x][i - 1]][i - 1];
  for (auto y : to[x])
    if (!dep[y]) pre(y, x);
  out[x] = dfnid;
}
int getlca(int x, int y) {
  if (dep[x] < dep[y]) swap(x, y);
  for (int i = (20), I = (0); i >= I; i--)
    if ((1ll << (i)) <= dep[x] - dep[y]) x = ff[x][i];
  if (x == y) return x;
  for (int i = (20), I = (0); i >= I; i--)
    if (ff[x][i] != ff[y][i]) x = ff[x][i], y = ff[y][i];
  return ff[x][0];
}
int getdis(int x, int y) { return dep[x] + dep[y] - 2 * dep[getlca(x, y)]; }
int G, SUM, mxs[N], siz[N];
bool ban[N];
void getrt(int x, int fa = 0) {
  mxs[x] = 0;
  siz[x] = 1;
  for (auto y : to[x])
    if (y != fa and !ban[y])
      getrt(y, x), siz[x] += siz[y], chmax(mxs[x], siz[y]);
  chmax(mxs[x], SUM - siz[x]);
  if (mxs[x] < mxs[G]) G = x;
}
int Fa[N];
void build_dvt(int x, int fa) {
  ban[x] = 1;
  Fa[x] = fa;
  printf("");
  for (auto y : to[x])
    if (!ban[y]) G = 0, getrt(y), build_dvt(G, x);
}
};  // namespace Tr
using namespace Tr;
void main() {
  int n = qread(), m = qread(), k = qread();
  for (int i = (1), I = (m); i <= I; i++) {
    int x = qread(), y = qread();
    to[x].push_back(y), to[y].push_back(x);
  }
  pre(1);
  for (int x = (1), I = (n); x <= I; x++)
    if (dep[x] >= ceil(1.0 * n / k)) {
      printf("PATH\n%d\n", dep[x]);
      for (int now = x; now > 0; now = ff[now][0]) write1(now);
      return;
    }
  puts("CYCLES");
  for (int x = (2), I = (n); x <= I; x++)
    if (in[x] == out[x] and k > 0) {
      k--;
      int A = 0, B = 0;
      for (auto y : to[x])
        if (y != ff[x][0]) {
          if (!A)
            A = y;
          else
            B = y;
        }
      if (dep[A] > dep[B]) swap(A, B);
      if ((dep[x] - dep[A] + 1) % 3) {
        write2(dep[x] - dep[A] + 1);
        for (int now = x; now != ff[A][0]; now = ff[now][0]) write1(now);
      } else if ((dep[x] - dep[B] + 1) % 3) {
        write2(dep[x] - dep[B] + 1);
        for (int now = x; now != ff[B][0]; now = ff[now][0]) write1(now);
      } else {
        write2(dep[B] - dep[A] + 2);
        write1(x);
        for (int now = B; now != ff[A][0]; now = ff[now][0]) write1(now);
      }
      puts("");
    }
}
};  // namespace mine
signed main() {
  srand(time(0));
  mine::main();
  printf("");
}
