#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e5 + 5;
const long long INF = 1e18;
const long long mod = 1e9 + 7;
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
vector<int> adj[mxN];
vector<int> a, b, path, cycle;
int pos[mxN];
void bipartite(int v, int col, int par) {
  if (col == 0)
    a.push_back(v);
  else
    b.push_back(v);
  for (auto x : adj[v]) {
    if (x != par) {
      bipartite(x, col ^ 1, v);
    }
  }
}
bool dfs(int v) {
  pos[v] = int((path).size());
  path.push_back(v);
  int low = -1;
  for (auto x : adj[v]) {
    if (pos[x] != -1 && pos[v] - pos[x] > 1) {
      low = max(low, pos[x]);
    }
  }
  if (low != -1) {
    for (int i = low; i <= pos[v]; i++) cycle.push_back(path[i]);
    return 1;
  }
  for (auto x : adj[v]) {
    if (pos[x] == -1) {
      if (dfs(x)) return 1;
    }
  }
  path.pop_back();
  return 0;
}
void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  if (m == (n - 1)) {
    bipartite(1, 0, -1);
    if (int((a).size()) < int((b).size())) swap(a, b);
    cout << 1 << '\n';
    for (int i = 0; i < (k + 1) / 2; i++) cout << a[i] << " ";
    cout << '\n';
    return;
  }
  memset(pos, -1, sizeof(pos));
  dfs(1);
  if (int((cycle).size()) <= k) {
    cout << 2 << '\n';
    cout << int((cycle).size()) << '\n';
    for (auto x : cycle) cout << x << " ";
    cout << '\n';
  } else {
    cout << 1 << '\n';
    for (int i = 0; i < (k + 1) / 2; i++) cout << cycle[2 * i] << " ";
    cout << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}
