#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int MAXN = 1e5 + 5;
int N, M, p[MAXN], col[MAXN], len[MAXN], dep[MAXN], sqN, bck[MAXN];
int anc[20][MAXN];
bool vis[MAXN];
vector<int> G[MAXN];
void cyc(int a, int b) {
  vector<int> s;
  int cur = a;
  while (cur != b) {
    s.push_back(cur);
    cur = p[cur];
  }
  cout << 2 << '\n';
  cout << 1 + s.size() << '\n';
  cout << b << ' ';
  for (int i : s) cout << i << ' ';
  exit(0);
}
void dfs(int cur, int par) {
  p[cur] = par;
  dep[cur] = dep[par] + 1;
  vis[cur] = 1;
  bool pos = 1;
  for (int nxt : G[cur]) {
    if (!vis[nxt])
      dfs(nxt, cur);
    else if (nxt != par) {
      if (dep[cur] - dep[nxt] + 1 >= sqN) cyc(cur, nxt);
    }
  }
  col[cur] = 1;
  for (int nxt : G[cur])
    if (col[nxt]) col[cur] = 0;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> M;
  sqN = sqrt(N);
  if (sqN * sqN < N) sqN++;
  for (int i = 1; i <= M; i++) {
    int a, b;
    cin >> a >> b;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  dfs(1, 0);
  vector<int> ans;
  for (int i = 1; i <= N; i++)
    if (col[i]) {
      ans.push_back(i);
      if (ans.size() == sqN) break;
    }
  cout << 1 << '\n';
  for (auto i : ans) cout << i << ' ';
}
