#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;
#ifndef WAIMAI
#include "islands.h"
#endif
#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif
#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second
const int SIZE = 2e5 + 5;
int n, m;
vector<int> ans;
vector<pair<int, int>> adj[SIZE];
variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
n = N, m = M;
for (int i = 0; i < m; i++) adj[U[i]].pb(V[i], i);
bool f = 1;
auto dfs = [&](auto dfs, int pos, int last)->void {
int cnt = adj[pos].size();
if (last != -1) cnt--;
if (cnt == 0) {
f = 0;
return;
}
vector<pair<int, int>> nxt;
for (auto [np, id] : adj[pos]) if (id != (last ^ 1)) nxt.pb(np, id);
if (cnt == 1) {
ans.pb(nxt[0].S);
dfs(dfs, nxt[0].F, nxt[0].S);
ans.pb(nxt[0].S);
} else {
int a = nxt[0].S, b = nxt[1].S;
ans.pb(a), ans.pb(a ^ 1);
ans.pb(b), ans.pb(b ^ 1);
ans.pb(a ^ 1), ans.pb(a);
ans.pb(b ^ 1), ans.pb(b);
}
};
dfs(dfs, 0, -1);
if (f) return ans;
return false;
}
/*
in1
4 5
0 1
1 2
2 3
0 3
3 1
out1
1
10
0 1 2 4 0 3 2 1 4 3
in2
2 3
0 1
1 0
1 0
out2
0
0
*/
#ifdef WAIMAI
int main() {
int N, M;
assert(2 == scanf("%d %d", &N, &M));
vector<int> U(M), V(M);
for (int i = 0; i < M; ++i) {
assert(2 == scanf("%d %d", &U[i], &V[i]));
}
variant<bool, vector<int>> result = find_journey(N, M, U, V);
if (result.index() == 0) {
printf("0\n");
if (get<bool>(result)) {
printf("1\n");
} else {
printf("0\n");
}
} else {
printf("1\n");
vector<int> &canoes = get<vector<int>>(result);
printf("%d\n", static_cast<int>(canoes.size()));
for (int i = 0; i < static_cast<int>(canoes.size()); ++i) {
if (i > 0) {
printf(" ");
}
printf("%d", canoes[i]);
}
printf("\n");
}
return 0;
}
#endif
