#include <bits/stdc++.h>
using namespace std;
namespace IO {
template <typename T>
inline void read(T &x) {
  x = 0;
  long long f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -f;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - 48;
    ch = getchar();
  }
  x = x * f;
}
}  // namespace IO
using namespace IO;
const int maxn = 1000000 + 10;
vector<int> G[maxn];
int n, m, k;
void addedge(int x, int y) { G[x].push_back(y), G[y].push_back(x); }
int deep[maxn];
int f[maxn];
int ans = 100000000;
int point;
void dfs(int u, int fa) {
  deep[u] = deep[fa] + 1;
  f[u] = fa;
  for (auto v : G[u]) {
    if (v == fa) continue;
    if (deep[v]) {
      if (abs(deep[u] - deep[v]) + 1 < ans) point = u;
      ans = min(ans, abs(deep[u] - deep[v]) + 1);
      if (ans <= k) {
        cout << 2 << endl;
        int len = abs(deep[u] - deep[v]) + 1;
        ;
        cout << len << endl;
        for (int res = u; len >= 1; len--, res = f[res]) {
          cout << res << " ";
        }
        exit(0);
      }
    } else {
      dfs(v, u);
    }
  }
}
int main() {
  read(n), read(m), read(k);
  for (int i = 1; i <= m; i++) {
    int x, y;
    read(x), read(y);
    addedge(x, y);
  }
  dfs(1, 0);
  if (m == n - 1) {
    vector<int> ans, ans2;
    for (int i = 1; i <= n; i++)
      if (deep[i] % 2 == 1) ans.push_back(i);
    for (int i = 1; i <= n; i++)
      if (deep[i] % 2 == 0) ans2.push_back(i);
    puts("1");
    if (ans.size() >= (k + 1) / 2) {
      for (int i = 0; i < (k + 1) / 2; i++) cout << ans[i] << " ";
      return 0;
    } else {
      for (int i = 0; i < (k + 1) / 2; i++) cout << ans2[i] << " ";
      return 0;
    }
  }
  cout << "1" << endl;
  k = (k + 1) / 2;
  for (int i = 1; i <= k; i++) {
    cout << point << " ";
    point = f[f[point]];
  }
  return 0;
}
