#include <bits/stdc++.h>
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 998244353;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(const pair<long long int, pair<int, int> > &p1,
                  const pair<long long int, pair<int, int> > &p2) const {
    return p1.first < p2.first;
  }
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
const long long int N = 1e5 + 5, inf = 2e18;
std::vector<int> adj[N];
int dist[N], n, m, k, par[N];
void dfs(int s, int p, int h) {
  dist[s] = h;
  par[s] = p;
  for (auto x : adj[s]) {
    if (x == p) continue;
    if (dist[x] != -1) {
      if (dist[x] < dist[s]) {
        if (dist[s] - dist[x] + 1 <= k) {
          int z = s;
          vector<int> t;
          while (z != x) {
            t.push_back(z + 1);
            z = par[z];
          }
          t.push_back(x + 1);
          cout << "2\n" << t.size() << '\n';
          printvec(t);
          exit(0);
        }
      }
    } else
      dfs(x, s, h + 1);
  }
}
void dfs3(int s, int p, int h) {
  dist[s] = h;
  par[s] = p;
  for (auto x : adj[s]) {
    if (x == p) continue;
    if (dist[x] != -1) {
      if (dist[x] < dist[s]) {
        int z = s;
        vector<int> t;
        while (z != x) {
          t.push_back(z + 1);
          z = par[z];
        }
        t.push_back(x + 1);
        cout << "1\n";
        int c = 0;
        vector<int> res;
        for (int i = (int)0; i < (int)(t.size()); i++) {
          c++;
          res.push_back(t[i]);
          if (c == (k + 1) / 2) break;
          i++;
        }
        printvec(res);
        exit(0);
      }
    } else
      dfs3(x, s, h + 1);
  }
}
vector<int> col[2];
void dfs2(int s, int p, int c) {
  col[c].push_back(s + 1);
  for (auto x : adj[s]) {
    if (x != p) dfs2(x, s, c ^ 1);
  }
}
void solve() {
  cin >> n >> m >> k;
  int x, y;
  for (int i = (int)0; i < (int)(m); i++) {
    if (i < n) dist[i] = -1;
    cin >> x >> y;
    x--;
    y--;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  dist[n - 1] = -1;
  dfs(0, -1, 0);
  memset(dist, -1, sizeof dist);
  dfs3(0, -1, 0);
  dfs2(0, -1, 0);
  if (col[0].size() >= (k + 1) / 2) {
    cout << "1\n";
    for (int i = (int)0; i < (int)((k + 1) / 2); i++) cout << col[0][i] << ' ';
    cout << '\n';
    return;
  }
  cout << "1\n";
  for (int i = (int)0; i < (int)((k + 1) / 2); i++) cout << col[1][i] << ' ';
  cout << '\n';
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (int tes = (int)0; tes < (int)(test); tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
