#include <bits/stdc++.h>
using namespace std;
long long sqr(long long x) { return x * x; }
int mysqrt(long long x) {
  int l = 0, r = 1e9 + 1;
  while (r - l > 1) {
    int m = (l + r) / 2;
    if (m * (long long)m <= x)
      l = m;
    else
      r = m;
  }
  return l;
}
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rndll(
    chrono::high_resolution_clock::now().time_since_epoch().count());
long long AR = 19, BR = 13, CR = 23, XR = 228, YR = 322, MODR = 1e9 + 993;
long long myrand() {
  long long ZR = (XR * AR + YR * BR + CR) % MODR;
  XR = YR;
  YR = ZR;
  return ZR;
}
int gcd(int a, int b) { return a ? gcd(b % a, a) : b; }
int gcdex(int a, int b, int &x, int &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  int x1, y1;
  int ret = gcdex(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return ret;
}
const int Mod = 1e9 + 7;
int Bpow(int x, long long y) {
  int ret = 1;
  int w = x;
  while (y) {
    if (y & 1) ret = (ret * (long long)w) % Mod;
    w = (w * (long long)w) % Mod;
    y >>= 1;
  }
  return ret;
}
int Bdiv(int x) {
  int a, b;
  gcdex(x, Mod, a, b);
  if (a < 0) a += Mod;
  return a;
}
int Bdiv(int x, int y) { return (x * (long long)Bpow(y, Mod - 2)) % Mod; }
inline int ad(int x, int y) { return x + y >= Mod ? x + y - Mod : x + y; }
inline int dif(int x, int y) { return x - y < 0 ? x - y + Mod : x - y; }
inline int mul(int x, int y) { return (x * (long long)y) % Mod; }
int inv(int a) {
  int b = Mod, x = 0, y = 1;
  while (a) {
    int t = b / a;
    b -= a * t;
    x -= t * y;
    swap(a, b);
    swap(x, y);
  }
  if (x < 0) x += Mod;
  return x;
}
void setmin(int &x, int y) { x = min(x, y); }
void setmax(int &x, int y) { x = max(x, y); }
void setmin(long long &x, long long y) { x = min(x, y); }
void setmax(long long &x, long long y) { x = max(x, y); }
const long long llinf = 1e18 + 100;
const long double eps = 1e-9;
const int maxn = 25e4 + 100, maxw = 1e6 + 100, inf = 2e9 + 100, sq = 100,
          X = 43, LG = 17;
vector<int> e[maxn];
int n;
int h[maxn];
int d[maxn];
int kek;
bool vis[maxn];
vector<vector<int> > answ;
int parent[maxn];
void go(int v, vector<int> &w) {
  if (v == -1) return;
  w.push_back(v);
  for (int i : e[v])
    if (h[i] == h[v] + 1 && d[v] == d[i] + 1) {
      go(i, w);
      break;
    }
}
void dfs(int v, int par) {
  int x = -1, y = -1;
  vis[v] = 1;
  for (int i : e[v])
    if (i == par)
      continue;
    else if (!vis[i]) {
      h[i] = h[v] + 1;
      parent[i] = v;
      dfs(i, v);
      if (x == -1 || d[i] > d[x])
        y = x, x = i;
      else if (y == -1 || d[i] > d[y])
        y = i;
    }
  if ((x == -1 ? 0 : d[x]) + (y == -1 ? 0 : d[y]) + 1 >= (n + kek - 1) / kek) {
    cout << "PATH\n";
    vector<int> o;
    go(x, o);
    reverse(o.begin(), o.end());
    o.push_back(v);
    go(y, o);
    cout << o.size() << '\n';
    for (int i : o) cout << i + 1 << ' ';
    cout << '\n';
    exit(0);
  }
  if (x != -1) {
    d[v] = d[x] + 1;
    return;
  }
  d[v] = 1;
  if (answ.size() < kek) {
    for (int i : e[v])
      if (i != par)
        if (x == -1)
          x = i;
        else
          y = i;
    if ((h[v] - h[y] + 1) % 3 != 0) swap(x, y);
    if ((h[v] - h[x] + 1) % 3 != 0) {
      vector<int> o;
      int cur = v;
      while (1) {
        o.push_back(cur);
        if (cur == x) break;
        cur = parent[cur];
      }
      answ.push_back(o);
      return;
    }
    if (h[x] > h[y]) swap(x, y);
    vector<int> o;
    int cur = v;
    bool vs = 0;
    while (1) {
      if (cur == y) vs = 1;
      if (vs || cur == v) o.push_back(cur);
      if (cur == x) break;
      cur = parent[cur];
    }
    answ.push_back(o);
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int edg;
  cin >> n >> edg >> kek;
  for (int i = 0; i < edg; i++) {
    int v, u;
    cin >> v >> u;
    v--;
    u--;
    e[v].push_back(u);
    e[u].push_back(v);
  }
  dfs(0, -1);
  cout << "CYCLES\n";
  for (auto i : answ) {
    cout << i.size() << '\n';
    for (auto j : i) cout << j + 1 << ' ';
    cout << '\n';
  }
}
