#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
vector<int> pr;
bool saw[maxn];
void gherbal(int mx) {
  for (int i = 2; i <= mx; i++) {
    if (!saw[i]) {
      pr.push_back(i);
      for (int j = 2 * i; j <= mx; j += i) {
        saw[j] = true;
      }
    }
  }
}
void printvec(vector<int> v) {
  int n = v.size();
  cout << "# ";
  for (int i = 0; i < n; i++) cout << v[i] << " ";
  cout << endl;
}
void printarr(int a[], int n) {
  for (int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
}
vector<int> subset;
void gen_subset(vector<int> v, int k) {
  if (k == v.size() - 1) {
    printvec(subset);
  } else {
    subset.push_back(v[k]);
    gen_subset(v, k + 1);
    subset.pop_back();
    gen_subset(v, k + 1);
  }
}
int visited[maxn];
int height[maxn];
int max_height = -1;
int max_height_vert = 0;
vector<int> adj[maxn];
vector<int> adj2[maxn];
vector<int> ans;
vector<int> bargs;
void dfs(int u) {
  visited[u] = 1;
  for (auto g : adj[u]) {
    if (!visited[g]) {
      adj2[u].push_back(g);
      adj2[g].push_back(u);
      height[g] = height[u] + 1;
      if (max_height < height[g]) {
        max_height = height[g];
        max_height_vert = g;
      }
      dfs(g);
    }
  }
}
void dfs2(int u) {
  visited[u] = 1;
  ans.push_back(u);
  for (auto g : adj2[u]) {
    if (height[g] == height[u] - 1) {
      dfs2(g);
      return;
    }
  }
}
void dfs3(int u, int target) {
  cout << u << " ";
  if (u == target) return;
  for (auto g : adj2[u]) {
    if (height[g] == height[u] - 1) {
      dfs3(g, target);
      return;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m, k;
  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);
  if (max_height + 1 >= n / k) {
    cout << "PATH" << endl;
    cout << max_height + 1 << endl;
    memset(visited, 0, sizeof(visited));
    dfs2(max_height_vert);
    reverse(ans.begin(), ans.end());
    for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  } else {
    cout << "CYCLES" << endl;
    int jj = 0;
    for (int i = 1; i <= n; i++) {
      if (adj2[i].size() == 1 && jj < k && i != 1) {
        jj++;
        int par = adj2[i][0];
        int x = -1;
        int y = -1;
        int cnt = 2;
        for (int j = 0; j < adj[i].size(); j++) {
          if (adj[i][j] != par) {
            if (cnt == 2) {
              x = adj[i][j];
              cnt--;
            } else if (cnt == 1) {
              y = adj[i][j];
              cnt--;
            } else {
              break;
            }
          }
        }
        memset(visited, 0, sizeof(visited));
        int mini;
        int maxi;
        if (abs(height[i] - height[y]) % 3 == 0 or
            abs(height[i] - height[y]) % 3 == 1) {
          cout << abs(height[i] - height[y]) + 1 << endl;
          dfs3(i, y);
          cout << endl;
        } else if ((height[i] - height[x]) % 3 == 0 or
                   (height[i] - height[x]) % 3 == 1) {
          cout << abs(height[i] - height[x]) + 1 << endl;
          dfs3(i, x);
          cout << endl;
        } else {
          if (height[x] > height[y]) {
            maxi = y;
            mini = x;
          } else {
            mini = y;
            maxi = x;
          }
          cout << abs(height[y] - height[x]) + 2 << endl;
          dfs3(mini, maxi);
          cout << i << endl;
        }
      }
    }
  }
}
