#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 5e5 + 7;
int n, m, k;
struct Edge {
  int e, next;
} edge[N << 1];
int head[N], cnt;
int sq, tag[N], dep[N];
void add(int s, int e) {
  edge[++cnt].e = e;
  edge[cnt].next = head[s];
  head[s] = cnt;
}
vector<int> G;
vector<int> ans;
void dfs(int now, int from) {
  G.push_back(now);
  dep[now] = G.size();
  for (int i = head[now]; i; i = edge[i].next) {
    int to = edge[i].e;
    if (!dep[to])
      dfs(to, now);
    else if (dep[now] - dep[to] >= sq - 1) {
      printf("2\n");
      printf("%d\n", dep[now] - dep[to] + 1);
      for (int i = dep[to] - 1; i < dep[now]; ++i) printf("%d ", G[i]);
      printf("\n");
      exit(0);
    }
  }
  if (!tag[now]) {
    ans.push_back(now);
    for (int i = head[now]; i; i = edge[i].next) {
      int to = edge[i].e;
      tag[to] = 1;
    }
  }
  G.pop_back();
  return;
}
int main() {
  scanf("%d%d", &n, &m);
  sq = sqrt(n - 1) + 1;
  for (int i = 1; i <= m; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    add(u, v);
    add(v, u);
  }
  dfs(1, 0);
  printf("1\n");
  for (int i = 0; i < sq; ++i) printf("%d ", ans[i]);
  printf("\n");
  return 0;
}
