#include <bits/stdc++.h>
using namespace std;
int n, m, k, par[300010], d[300010];
bool isleaf[300010], was[300010];
vector<vector<int> > gr;
void dfs(int x) {
  if (was[x]) {
    return;
  }
  was[x] = 1;
  d[x] = d[par[x]] + 1;
  isleaf[x] = 1;
  for (auto i : gr[x]) {
    if (!was[i]) {
      isleaf[x] = 0;
      par[i] = x;
      dfs(i);
    }
  }
}
void rootpath(int x, int l) {
  for (int i = 0; i < l; ++i) {
    cout << x + 1 << " ";
    x = par[x];
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> m >> k;
  vector<int> vi;
  gr.resize(n, vi);
  for (int i = 0; i < m; ++i) {
    int u, v;
    cin >> u >> v;
    --u, v--;
    gr[u].push_back(v);
    gr[v].push_back(u);
  }
  dfs(0);
  for (int i = 0; i < n; ++i) {
    if (d[i] >= (n + k - 1) / k) {
      cout << "PATH\n" << d[i] << "\n";
      rootpath(i, d[i]);
      return 0;
    }
  }
  cout << "CYCLES\n";
  for (int i = 0; i < n; ++i) {
    if (!k or !isleaf[i]) {
      continue;
    }
    int x = gr[i][0], y = gr[i][1];
    if (x == par[i]) {
      x = gr[i][2];
    }
    if (y == par[i]) {
      y = gr[i][2];
    }
    if (d[y] < d[x]) {
      swap(x, y);
    }
    int xyi = d[y] - d[x] + 2;
    int ix = d[i] - d[x] + 1;
    int iy = d[i] - d[y] + 1;
    if (xyi % 3) {
      cout << xyi << "\n" << i + 1 << " ";
      rootpath(y, xyi - 1);
    } else if (ix % 3) {
      cout << ix << "\n";
      rootpath(i, ix);
    } else {
      cout << iy << "\n";
      rootpath(i, iy);
    }
    --k;
  }
}
