#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
const int N = 100010;
struct edge {
  int v, nxt;
} e[N << 1];
int head[N], cnt, n, m, k, x, y, dep[N], fa[N], ans, out[N];
inline void add(int u, int v) {
  e[++cnt].v = v;
  e[cnt].nxt = head[u];
  head[u] = cnt;
}
inline bool dfs(int u) {
  for (int i = head[u]; i; i = e[i].nxt) {
    int v = e[i].v;
    if (v == fa[u]) continue;
    if (!fa[v]) {
      fa[v] = u;
      dep[v] = dep[u] + 1;
      if (dfs(v)) return 1;
    } else if (dep[u] - dep[v] >= k) {
      ans = dep[u] - dep[v] + 1;
      for (int j = u; j != v; j = fa[j]) {
        out[++out[0]] = j;
      }
      out[++out[0]] = v;
      return 1;
    }
  }
  return 0;
}
int main() {
  n = read();
  m = read();
  k = read();
  for (int i = 1; i <= m; ++i) {
    x = read();
    y = read();
    add(x, y);
    add(y, x);
  }
  bool csyakioi = dfs(fa[1] = 1);
  printf("%d\n", ans);
  for (int i = 1; i <= out[0]; ++i) printf("%d ", out[i]);
  return 0;
}
