#include <bits/stdc++.h>
using namespace std;
int n, m, sz;
vector<int> deg;
vector<vector<int>> adj;
int main() {
  scanf("%d%d", &n, &m);
  while (sz * sz < n) sz++;
  adj.resize(n + 1);
  deg.resize(n + 1);
  for (int a, b, i = 0; i < m; i++) {
    scanf("%d%d", &a, &b);
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  set<pair<int, int>> nodes;
  for (int u = 1; u <= n; u++) nodes.insert({deg[u] = adj[u].size(), u});
  vector<int> iset, bad(n + 1);
  while (!nodes.empty()) {
    auto p = *nodes.begin();
    nodes.erase(nodes.begin());
    if (p.first >= sz - 1) break;
    iset.push_back(p.second);
    bad[p.second] = true;
    for (int& v : adj[p.second])
      if (!bad[v]) {
        bad[v] = true;
        nodes.erase({deg[v], v});
        for (int& w : adj[v])
          if (!bad[w]) {
            nodes.erase({deg[w], w});
            deg[w]--;
            nodes.insert({deg[w], w});
          }
      }
  }
  if (iset.size() >= sz) {
    iset.resize(sz);
    printf("1\n");
    for (int& u : iset) printf("%d ", u);
    printf("\n");
    return 0;
  }
  int st;
  for (int u = 1; u <= n; u++) {
    if (bad[u])
      adj[u].clear();
    else {
      vector<int> good;
      for (int& v : adj[u])
        if (!bad[v]) good.push_back(v);
      swap(adj[u], good);
      st = u;
    }
  }
  vector<int> path{st}, pos(n + 1);
  while (true) {
    int u = path.back();
    pos[u] = path.size();
    for (int& v : adj[u])
      if (!pos[v]) {
        path.push_back(v);
        break;
      }
    if (pos[u] == path.size()) {
      int e = INT_MAX;
      for (int& v : adj[u]) e = min(e, pos[v]);
      path.erase(path.begin(), path.begin() + e - 1);
      break;
    }
  }
  printf("2\n");
  printf("%d\n", path.size());
  for (int& u : path) printf("%d ", u);
  printf("\n");
}
