#include <bits/stdc++.h>
using namespace std;
int n, m, k, x, y;
vector<int> g[300005];
int d[300005], pre[300005], vis[300005], a[300005];
void dfs(int u) {
  vis[u] = 1;
  for (int i = 0; i < g[u].size(); i++) {
    int v = g[u][i];
    if (vis[v]) continue;
    a[u]++;
    d[v] = d[u] + 1;
    pre[v] = u;
    dfs(v);
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  ;
  cin >> n >> m >> k;
  for (int i = 1; i <= m; i++) {
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  dfs(1);
  int h = (n - 1) / k + 1;
  for (int i = 1; i <= n; i++) {
    if (d[i] + 1 >= h) {
      cout << "PATH" << endl;
      cout << d[i] + 1 << endl;
      for (int j = i; j; j = pre[j]) {
        cout << j << " ";
      }
      return 0;
    }
  }
  cout << "CYCLES" << endl;
  for (int i = 1; i <= n; i++) {
    if (!a[i]) {
      vector<int> v;
      for (int j = 0; j < g[i].size(); j++) {
        if (g[i][j] != pre[i]) v.push_back(g[i][j]);
      }
      int x = v[0], y = v[1];
      if (d[x] < d[y]) swap(x, y);
      if ((d[i] - d[x] + 1) % 3 != 0) {
        cout << d[i] - d[x] + 1 << endl;
        for (int j = i; j != x; j = pre[j]) {
          cout << j << " ";
        }
        cout << x << endl;
      } else if ((d[i] - d[y] + 1) % 3 != 0) {
        cout << d[i] - d[y] + 1 << endl;
        for (int j = i; j != y; j = pre[j]) {
          cout << j << " ";
        }
        cout << y << endl;
      } else if ((d[x] - d[y] + 2) % 3 != 0) {
        cout << d[x] - d[y] + 2 << endl;
        cout << i << " ";
        for (int j = x; j != y; j = pre[j]) {
          cout << j << " ";
        }
        cout << y << endl;
      }
      k--;
      if (k == 0) break;
    }
  }
}
