#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  if (n == 1) return cout << 1 << '\n' << 1, 0;
  int sq = ceil(sqrt(n));
  vector<unordered_map<int, bool>> mat(n);
  vector<vector<int>> adj(n);
  vector<int> deg(n);
  for (int i = 0, u, v; i < m; i++) {
    scanf("%d%d", &u, &v);
    --u, --v;
    adj[u].push_back(v);
    adj[v].push_back(u);
    mat[u][v] = mat[v][u] = true;
    ++deg[u];
    ++deg[v];
  }
  vector<int> vec;
  vector<bool> mark(n);
  set<pair<int, int>> cur;
  for (int i = 0; i < n; i++) cur.insert({deg[i], i}), mark[i] = true;
  while (!cur.empty()) {
    if (cur.begin()->first >= sq - 1) {
      puts("2");
      vector<int> vec({cur.begin()->second}), id(n), seen(n);
      seen[cur.begin()->second] = true;
      while (vec.size() < sq || !mat[vec.front()][vec.back()]) {
        for (int u : adj[vec.back()])
          if (mark[u] && !seen[u]) {
            id[u] = vec.size();
            vec.push_back(u);
            seen[u] = true;
            break;
          } else if (mark[u] && (id[vec.back()] - id[u] >= sq - 1)) {
            reverse(vec.begin(), vec.end());
            while (vec.back() != u) vec.pop_back();
            break;
          }
      }
      printf("%d\n", (int)vec.size());
      for (int u : vec) printf("%d ", u + 1);
      return 0;
    }
    int u = cur.begin()->second;
    cur.erase(cur.begin());
    vec.push_back(u);
    if (vec.size() >= sq) break;
    mark[u] = false;
    for (int v : adj[u])
      if (mark[v]) {
        cur.erase({deg[v], v});
        mark[v] = false;
        for (int x : adj[v])
          if (mark[x]) {
            cur.erase({deg[x], x});
            --deg[x];
            cur.insert({deg[x], x});
          }
      }
  }
  puts("1");
  for (int i = 0; i < sq; i++) printf("%d ", vec[i] + 1);
  return 0;
}
