#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
vector<int> g[maxn], son[maxn];
int n, m, k, fa[maxn], vis[maxn];
set<int> s;
void dfs(int u, int f) {
  if (s.size() == k) return;
  s.insert(u);
  vis[u] = 1;
  for (auto v : g[u]) {
    if (v == f || vis[v]) continue;
    dfs(v, u);
  }
}
void dfs2(int u, int f) {
  vis[u] = 1;
  fa[u] = f;
  for (auto v : son[u]) {
    if (v == f) continue;
    if (vis[v]) {
      cout << 2 << "\n";
      int now = u;
      vector<int> ans;
      while (now != fa[v]) {
        ans.push_back(now);
        now = fa[now];
      }
      cout << ans.size() << "\n";
      for (auto x : ans) cout << x << " ";
      cout << "\n";
      exit(0);
    }
    dfs2(v, u);
  }
}
vector<int> odd, even;
void dfs3(int u, int f, int dep) {
  if (dep & 1)
    odd.push_back(u);
  else
    even.push_back(u);
  for (auto v : son[u]) {
    if (v == f) continue;
    dfs3(v, u, dep + 1);
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  t = 1;
  while (t--) {
    cin >> n >> m >> k;
    for (int i = 1; i <= m; ++i) {
      int u, v;
      cin >> u >> v;
      g[u].push_back(v);
      g[v].push_back(u);
    }
    dfs(1, 0);
    for (int i = 0; i <= n; ++i) vis[i] = 0;
    for (int u = 1; u <= n; ++u) {
      if (s.find(u) == s.end()) continue;
      for (auto v : g[u]) {
        if (s.find(v) != s.end()) son[u].push_back(v);
      }
    }
    dfs2(*s.begin(), 0);
    dfs3(*s.begin(), 0, 1);
    cout << "1\n";
    if (odd.size() > even.size()) {
      for (int i = 0; i < (k + 1) / 2; ++i) cout << odd[i] << " ";
    } else {
      for (int i = 0; i < (k + 1) / 2; ++i) cout << even[i] << " ";
    }
    cout << "\n";
  }
}
