#include <bits/stdc++.h>
using namespace std;
template <class T>
void print(vector<T> s) {
  for (T i : s) cout << i << " ";
  cout << endl;
}
struct node {
  int x;
  node* first;
  node* second;
  node(int x) {
    this->x = x;
    first = nullptr;
    second = nullptr;
  }
};
const int maxn = 3e5;
int color[maxn], dist[maxn], aaaasds[maxn];
vector<int> s[maxn];
vector<int> leaves;
void dfs(int v) {
  color[v] = 1;
  bool ok = false;
  for (int u : s[v]) {
    if (color[u] == 0) {
      dist[u] = dist[v] + 1;
      aaaasds[u] = v;
      dfs(u);
      ok = true;
    }
  }
  if (!ok) leaves.push_back(v);
}
void restore1(int v, int u) {
  cout << dist[v] - dist[u] + 1 << "\n";
  while (v != u) {
    cout << v + 1 << " ";
    v = aaaasds[v];
  }
  cout << u + 1 << "\n";
}
void restore2(int v, int u1, int u2) {
  if (dist[u1] > dist[u2]) swap(u1, u2);
  cout << dist[u2] - dist[u1] + 2 << "\n";
  cout << v + 1 << " ";
  while (u1 != u2) {
    cout << u2 + 1 << " ";
    u2 = aaaasds[u2];
  }
  cout << u1 + 1 << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    s[a - 1].push_back(b - 1);
    s[b - 1].push_back(a - 1);
  }
  dfs(0);
  int x = 0;
  for (int i = 0; i < n; i++)
    if (dist[i] > dist[x]) x = i;
  if (dist[x] * k < n) {
    cout << "CYCLES\n";
    for (int i = 0; i < k; i++) {
      int v = leaves[i];
      vector<int> u;
      for (int l : s[v]) {
        assert(dist[l] < dist[v]);
        if (dist[l] + 1 < dist[v]) u.push_back(l);
      }
      if ((dist[v] - dist[u[0]]) % 3 != 2) {
        restore1(v, u[0]);
        continue;
      }
      if ((dist[v] - dist[u[1]]) % 3 != 2) {
        restore1(v, u[1]);
        continue;
      }
      restore2(v, u[0], u[1]);
    }
  } else {
    cout << "PATH\n";
    cout << dist[x] + 1 << "\n";
    while (x > 0) {
      cout << x + 1 << " ";
      x = aaaasds[x];
    }
    cout << x + 1 << "\n";
  }
  return 0;
}
