#include <bits/stdc++.h>
using namespace std;
template <typename TH>
void _dbg(const char* sdbg, TH h) {
  cerr << sdbg << "=" << h << "\n";
}
template <typename TH, typename... TA>
void _dbg(const char* sdbg, TH h, TA... t) {
  while (*sdbg != ',') {
    cerr << *sdbg++;
  }
  cerr << "=" << h << ",";
  _dbg(sdbg + 1, t...);
}
template <class C>
void mini(C& a4, C b4) {
  a4 = min(a4, b4);
}
template <class C>
void maxi(C& a4, C b4) {
  a4 = max(a4, b4);
}
template <class T1, class T2>
ostream& operator<<(ostream& out, pair<T1, T2> pair) {
  return out << "(" << pair.first << ", " << pair.second << ")";
}
template <class A, class B, class C>
struct Triple {
  A first;
  B second;
  C third;
  bool operator<(const Triple& t) const {
    if (first != t.first) return first < t.first;
    if (second != t.second) return second < t.second;
    return third < t.third;
  }
};
template <class T>
void ResizeVec(T&, vector<long long>) {}
template <class T>
void ResizeVec(vector<T>& vec, vector<long long> sz) {
  vec.resize(sz[0]);
  sz.erase(sz.begin());
  if (sz.empty()) {
    return;
  }
  for (T& v : vec) {
    ResizeVec(v, sz);
  }
}
template <class A, class B, class C>
ostream& operator<<(ostream& out, Triple<A, B, C> t) {
  return out << "(" << t.first << ", " << t.second << ", " << t.third << ")";
}
template <class T>
ostream& operator<<(ostream& out, vector<T> vec) {
  out << "(";
  for (auto& v : vec) out << v << ", ";
  return out << ")";
}
template <class T>
ostream& operator<<(ostream& out, set<T> vec) {
  out << "(";
  for (auto& v : vec) out << v << ", ";
  return out << ")";
}
template <class L, class R>
ostream& operator<<(ostream& out, map<L, R> vec) {
  out << "(";
  for (auto& v : vec) out << v << ", ";
  return out << ")";
}
const long long N = 1e6 + 5;
long long dep[N];
long long path_at_least;
vector<long long> stackk;
vector<long long> slo[N];
vector<vector<long long> > cycles;
long long n, m, k;
long long vis[N];
void PutCyc(long long v, long long d1, long long d2) {
  vector<long long> cyc{v};
  for (long long i = (d1); i <= (d2); ++i) {
    cyc.push_back(stackk[i]);
  }
  cycles.push_back(cyc);
  if (((long long)(cycles).size()) == k) {
    cout << "CYCLES\n";
    for (auto c : cycles) {
      cout << ((long long)(c).size()) << "\n";
      for (auto u : c) {
        cout << u << " ";
      }
      cout << "\n";
    }
    exit(0);
  }
}
void Dfs(long long v, long long p) {
  stackk.push_back(v);
  vis[v] = 1;
  vector<long long> non_parents;
  long long any_child = 0;
  for (auto nei : slo[v]) {
    if (nei == p) {
      continue;
    }
    if (vis[nei]) {
      non_parents.push_back(nei);
    } else {
      dep[nei] = dep[v] + 1;
      Dfs(nei, v);
      any_child = 1;
    }
  }
  if (!any_child) {
    long long d1 = dep[non_parents[0]];
    long long d2 = dep[non_parents[1]];
    if (d1 > d2) {
      swap(d1, d2);
    }
    if (dep[v] - d1 + 1 >= path_at_least) {
      cout << "PATH\n";
      cout << dep[v] - d1 + 1 << endl;
      for (long long i = (d1); i <= (dep[v]); ++i) {
        cout << stackk[i] << " ";
      }
      cout << endl;
      exit(0);
    }
    if ((dep[v] - d1) % 3 != 2) {
      PutCyc(v, d1, dep[v] - 1);
    } else if ((dep[v] - d2) % 3 != 2) {
      PutCyc(v, d2, dep[v] - 1);
    } else {
      PutCyc(v, d1, d2);
    }
  }
  stackk.pop_back();
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  if (0) cout << fixed << setprecision(10);
  cin.tie(0);
  cin >> n >> m >> k;
  path_at_least = (n + k - 1) / k;
  for (long long i = (1); i <= (m); ++i) {
    long long a, b;
    cin >> a >> b;
    slo[a].push_back(b);
    slo[b].push_back(a);
  }
  Dfs(1, -1);
  assert(false);
  return 0;
}
