#include <bits/stdc++.h>
char _;
using namespace std;
void PRINT(int x, int y) {
  for (int i = y - 1; i >= 0; i--) {
    cout << ((0u == (x & (1 << i))) ? 0u : 1u);
  }
  cout << endl;
}
vector<string> vec_splitter(string s) {
  s += ',';
  vector<string> res;
  while (!s.empty()) {
    res.push_back(s.substr(0, s.find(',')));
    s = s.substr(s.find(',') + 1);
  }
  return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
               __attribute__((unused)) int idx,
               __attribute__((unused)) int LINE_NUM) {
  cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
  if (idx > 0)
    cerr << ", ";
  else
    cerr << "Line(" << LINE_NUM << ") ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, LINE_NUM, T...);
}
int n, m, k, d[100005] = {0}, c[100005] = {0};
vector<vector<int> > g(100005);
bool cyc = false;
int ca, cb;
vector<int> cycAns;
bool dfsT(int pos, int par) {
  d[pos] = d[par] + 1;
  int ans = -1;
  for (int x = 0; x < g[pos].size(); x++) {
    int nxt = g[pos][x];
    if (nxt == par) {
      continue;
    }
    if (cyc) {
      break;
    }
    if (d[nxt] != 0) {
      if (ans == -1 || d[nxt] > d[ans]) {
        ans = nxt;
      }
    }
  }
  if (ans != -1) {
    cyc = true;
    ca = ans;
    cb = pos;
    cycAns.push_back(pos);
    return true;
  }
  if (!cyc) {
    for (int x = 0; x < g[pos].size(); x++) {
      int nxt = g[pos][x];
      if (cyc) {
        break;
      }
      if (d[nxt] == 0) {
        if (dfsT(nxt, pos)) {
          cycAns.push_back(pos);
          if (pos == ca) {
            if (cycAns.size() <= k) {
              cout << 2 << "\n";
              cout << cycAns.size() << "\n";
              for (int x = 0; x < cycAns.size(); x++) {
                cout << cycAns[x] << " ";
              }
              cout << "\n";
            } else {
              cout << 1 << "\n";
              int ansPos = 0;
              for (int x = 0; x < (k + 1) / 2; x++) {
                cout << cycAns[ansPos] << " ";
                ansPos += 2;
              }
              cout << "\n";
            }
            exit(0);
          } else {
            return true;
          }
        }
      }
    }
  }
  return false;
}
bool is = false;
vector<vector<int> > col(2);
void tree(int pos, int par, bool c) {
  col[c].push_back(pos);
  for (int x = 0; x < g[pos].size(); x++) {
    if (g[pos][x] != par) {
      tree(g[pos][x], pos, !c);
    }
  }
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> k;
  for (int x = 0; x < m; x++) {
    int a, b;
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  dfsT(1, 0);
  tree(1, -1, 0);
  int idx = 0;
  if (col[1].size() > col[0].size()) {
    idx = 1;
  }
  cout << 1 << "\n";
  for (int x = 0; x < (k + 1) / 2; x++) {
    cout << col[idx][x] << " ";
  }
  cout << "\n";
  return 0;
}
