#include <bits/stdc++.h>
using namespace std;
const int Alp = 26;
const int __PRECISION = 9;
const int inf = 1e9 + 8;
const long double PI = acos(-1);
const long double EPS = 1e-7;
const long long MOD = 1e9 + 7;
const long long MAXN = 2e5 + 5;
const long long ROOTN = 320;
const long long LOGN = 18;
const long long INF = 1e18 + 1022;
int N, M, sq, SQ, dep[MAXN], par[MAXN];
vector<int> g[MAXN], party[ROOTN];
bool vis[MAXN];
inline void print_cycle(int a, int p) {
  cout << "2\n";
  vector<int> ans;
  ans.push_back(a);
  do {
    a = par[a];
    ans.push_back(a);
  } while (a != p);
  cout << ans.size() << '\n';
  for (int x : ans) {
    cout << x << ' ';
  }
  cout << '\n';
  exit(0);
}
void dfs(int a) {
  vis[a] = true;
  party[dep[a] % sq].push_back(a);
  for (int b : g[a]) {
    if (vis[b] && dep[a] - dep[b] >= sq) {
      print_cycle(a, b);
    } else if (!vis[b]) {
      dep[b] = dep[a] + 1;
      par[b] = a;
      dfs(b);
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> N >> M;
  for (int i = 0; i < (M); ++i) {
    int x, y;
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  for (int i = 1; i <= (N); ++i) {
    vis[i] = false;
  }
  sq = SQ = sqrt(N);
  if (SQ * SQ != N) {
    ++SQ;
  }
  dep[1] = 0;
  par[1] = -1;
  dfs(1);
  cout << "1\n";
  for (int i = 0; i < (sq); ++i) {
    if ((int)party[i].size() >= SQ) {
      for (int j = 0; j < (SQ); ++j) {
        cout << party[i][j] << ' ';
      }
      cout << '\n';
      exit(0);
    }
  }
  return 0;
}
