#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
const int N = 3e5 + 5;
int n, m, k, vis[N], depth[N], leaf[N], par[N];
vector<int> adj[N];
void dfs(int node, int pr) {
  vis[node] = leaf[node] = 1;
  depth[node] = depth[pr] + 1;
  par[node] = pr;
  for (auto& v : adj[node]) {
    if (vis[v]) continue;
    dfs(v, node);
    leaf[node] = 0;
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> m >> k;
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  dfs(1, 0);
  for (int i = 1; i <= n; i++) {
    if ((long long)depth[i] * k >= n) {
      cout << "PATH\n" << depth[i] << "\n";
      while (i) {
        cout << i << " ";
        i = par[i];
      }
      return 0;
    }
  }
  cout << "CYCLES\n";
  for (int u = 1; u <= n && k > 0; u++) {
    if (!leaf[u]) continue;
    k--;
    vector<int> cycle = {u};
    for (int& v : adj[u]) {
      if (depth[v] < depth[u] - 1 && (depth[u] - depth[v]) % 3 != 2) {
        int s = u;
        while (s != v) {
          s = par[s];
          cycle.push_back(s);
        }
        break;
      }
    }
    if (cycle.size() == 1) {
      set<int> st = {adj[u][0], adj[u][1], adj[u][2]};
      st.erase(par[u]);
      int v1 = (*st.begin());
      st.erase(st.begin());
      int v2 = (*st.begin());
      st.erase(st.begin());
      if (depth[v1] > depth[v2]) swap(v1, v2);
      cycle.push_back(v2);
      while (v2 != v1) {
        v2 = par[v2];
        cycle.push_back(v2);
      }
    }
    cout << cycle.size() << "\n";
    for (int& v : cycle) cout << v << " ";
    cout << "\n";
  }
}
