#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const long double EPS = 0.00000001;
const long double PI = acos(-1.);
const int N = 500005;
int n, m, k, cycle;
vector<vector<int>> adj;
int vis[N];
int vis1[N];
int cost[N];
vector<int> ans;
int dfs(int nod, int prnt) {
  if (vis[nod] == 1) {
    if (cost[prnt] + 1 - cost[nod] <= k) {
      cycle = cost[prnt] + 1 - cost[nod];
      ans.push_back(nod);
      return 2;
    }
    return 1;
  }
  if (vis[nod] == 2) return 1;
  vis[nod] = 1;
  cost[nod] = cost[prnt] + 1;
  for (auto nxt : adj[nod]) {
    if (nxt == prnt) continue;
    int t = dfs(nxt, nod);
    if (t == 2) {
      ans.push_back(nod);
      return 2;
    }
  }
  vis[nod] = 2;
  return 1;
}
int dfs1(int nod) {
  if (vis1[nod]) return 0;
  vis1[nod] = 1;
  int cnt = 0;
  for (auto nxt : adj[nod]) {
    cnt += dfs1(nxt);
  }
  if (cnt == 0) {
    ans.push_back(nod);
    return 1;
  }
  return 0;
}
int test_case() {
  cin >> n >> m >> k;
  adj.resize(n + 3);
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  cost[0] = -1;
  int pro = dfs(1, 0);
  if (pro == 2) {
    cout << 2 << endl << cycle << endl;
    for (int i = 0; i < cycle; i++) {
      cout << ans[i] << " ";
    }
    cout << endl;
  } else {
    dfs1(1);
    k++;
    k /= 2;
    cout << 1 << endl;
    for (int i = 0; i < k; i++) {
      cout << ans[i] << " ";
    }
    cout << endl;
  }
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  t = 1;
  while (t--) {
    test_case();
  }
  return 0;
}
