#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 9;
const long long int mod = 1e9 + 7;
map<long long int, long long int> mpp, mp;
vector<long long int> u, v[N];
multiset<long long int> st, stt;
long long int c[N], t[] = {0, 2, 4, 9, 10, 11};
long long int a[N], n, m, k, vis[N], parent[N], level[N], length;
long long int dfs(long long int x, long long int papa, long long int lvl) {
  vis[x] = 1;
  parent[x] = papa;
  level[x] = lvl;
  for (auto i : v[x]) {
    if (!vis[i]) {
      long long int l = dfs(i, x, level[x] + 1);
      if (l) return l;
    } else if (vis[i] && i != papa) {
      if (lvl - level[i] + 1 >= k + 1) {
        length = lvl - level[i] + 1;
        return x;
      }
    }
  }
  vis[x] = 0;
  return 0;
}
void solve() {
  cin >> n >> m >> k;
  for (int i = 1; i <= m; ++i) {
    long long int x, y;
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  long long int cnt = 0;
  level[1] = 1;
  long long int l = dfs(1, 1, 1);
  cout << length << '\n' << l << " ";
  while (--length) {
    cout << parent[l] << " ";
    l = parent[l];
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) solve();
}
