#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 7;
long long n, m, k;
vector<long long> g[N];
bool used[N];
long long h[N];
long long par[N];
long long som = -1;
void dfs(long long u) {
  used[u] = 1;
  bool leaf = 1;
  for (long long v : g[u]) {
    if (!used[v]) {
      h[v] = h[u] + 1;
      par[v] = u;
      dfs(v);
      leaf = 0;
    }
  }
  if (leaf) som = u;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> k;
  for (long long i = 0; i < m; ++i) {
    long long u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  par[1] = 1;
  dfs(1);
  long long u = som;
  assert(u != -1);
  long long up = -1;
  for (long long v : g[u]) {
    if (h[v] <= h[u] - k) {
      up = v;
    }
  }
  assert(up != -1);
  cout << h[u] - h[up] + 1 << '\n';
  long long t = u;
  while (t != up) {
    cout << t << ' ';
    t = par[t];
  }
  cout << t << '\n';
}
