#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());
int need, timer;
vector<int> v[100010];
int tin[100010];
int color[100010];
int pepe[100010];
int flag[100010];
vector<int> cycle;
int mark = -1;
bool cmp(int a, int b) { return v[a].size() < v[b].size(); }
void dfs(int x, int gl) {
  tin[x] = gl;
  for (int i = 0; i < (int)v[x].size(); i++) {
    int to = v[x][i];
    if (tin[to] != 0) {
      if (tin[x] - tin[to] + 1 >= need) {
        mark = to;
        cycle.push_back(x);
        return;
      }
    }
    if (tin[to] != 0) continue;
    dfs(to, gl + 1);
    if (mark != -1) {
      cycle.push_back(x);
      if (mark == x) {
        cout << 2 << endl;
        cout << cycle.size() << endl;
        for (int j = 0; j < (int)cycle.size(); j++) cout << cycle[j] << ' ';
        exit(0);
      }
      return;
    }
  }
}
int main() {
  srand(time(0));
  ios_base::sync_with_stdio(0);
  int n, m;
  cin >> n >> m;
  need = sqrt(n);
  while (need * need > n) need--;
  while (need * need < n) need++;
  for (int i = 1; i <= m; i++) {
    int x, y;
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  for (int i = 1; i <= n; i++) {
    shuffle(v[i].begin(), v[i].end(), rnd);
  }
  dfs(((rand()) % n) + 1, 1);
  for (int i = 1; i <= n; i++) pepe[i] = i;
  sort(pepe + 1, pepe + n + 1, cmp);
  vector<int> ans;
  for (int i = 1; i <= n; i++)
    if (flag[pepe[i]] == 0) {
      if ((int)ans.size() == need) break;
      int fefe = 0;
      for (int j = 0; j < (int)v[pepe[i]].size(); j++) {
        int to = v[pepe[i]][j];
        if (flag[to] != 0) {
          fefe = 1;
        }
      }
      if (fefe == 0) {
        ans.push_back(pepe[i]);
        flag[pepe[i]] = 1;
      }
    }
  cout << 1 << endl;
  for (int i = 0; i < (int)ans.size(); i++) cout << ans[i] << ' ';
}
