#include <bits/stdc++.h>
using namespace std;
vector<int> v[100010];
vector<int> cycle;
int vis[100010];
int hs[100010];
int solve(int x, int p, int h) {
  vis[x] = 1;
  hs[x] = h;
  int ans = -1;
  int maxH = -1;
  for (auto y : v[x]) {
    if (vis[y] == 1 && y != p && hs[y] > maxH) {
      ans = y;
      maxH = hs[y];
    }
  }
  if (ans != -1) {
    vis[x] = 2;
    cycle.push_back(x);
    return ans;
  }
  for (auto y : v[x]) {
    if (vis[y] == 0) {
      ans = solve(y, x, h + 1);
      if (ans == -1) {
        continue;
      } else if (ans == -2) {
        break;
      } else {
        cycle.push_back(x);
        if (ans == x) ans = -2;
        break;
      }
    }
  }
  vis[x] = 2;
  return ans;
}
void solve2(int x, int h) {
  hs[x] = h;
  for (auto y : v[x]) {
    if (hs[y] == -1) {
      solve2(y, h + 1);
    }
  }
}
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < m; ++i) {
    int a, b;
    cin >> a >> b;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  solve(1, -1, 0);
  if (cycle.size() > 0) {
    if (cycle.size() <= k) {
      cout << 2 << endl << cycle.size() << endl;
      for (auto x : cycle) cout << x << " ";
      cout << endl;
    } else {
      cout << 1 << endl;
      for (int i = 0; i < (k + 1) / 2; ++i) {
        cout << cycle[2 * i] << " ";
      }
      cout << endl;
    }
  } else {
    cout << 1 << endl;
    vector<int> hss[100010];
    memset(hs, -1, sizeof hs);
    solve2(1, 0);
    for (int i = 1; i <= n; ++i) {
      hss[hs[i]].push_back(i);
    }
    for (int i = 0; i < 2; ++i) {
      vector<int> ans;
      for (int j = i; j < 100010; j += 2) {
        for (auto x : hss[j]) {
          ans.push_back(x);
        }
      }
      if (ans.size() >= (k + 1) / 2) {
        for (int i = 0; i < (k + 1) / 2; ++i) {
          cout << ans[i] << " ";
        }
        cout << endl;
        break;
      }
    }
  }
}
