#include <bits/stdc++.h>
using namespace std;
int II() {
  int q;
  scanf("%d", &q);
  return q;
}
int dx[] = {0, -1, 0, 1};
int dy[] = {-1, 0, 1, 0};
int dxx[] = {0, -1, -1, -1, 0, 1, 1, 1};
int dyy[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int n, m, k;
vector<int> v[100005], ans;
int dist[100005];
int vis[100005];
int temp;
bool dfs(int u, int di) {
  dist[u] = di;
  vis[u] = 1;
  for (auto it : v[u]) {
    if (vis[it] == 1) {
      if (abs(dist[it] - dist[u]) >= k) {
        temp = abs(dist[it] - dist[u]) - 1;
        ans.push_back(it);
        return 1;
      }
    }
    if (vis[it] == 0) {
      if (dfs(it, di + 1)) {
        if (temp >= 0) {
          ans.push_back(it);
          temp--;
        }
        return 1;
      }
    }
  }
  vis[u] = 2;
  return 0;
}
void solve() {
  cin >> n >> m >> k;
  for (int i = 0; i < m; i++) {
    int u, vv;
    cin >> u >> vv;
    v[u].push_back(vv);
    v[vv].push_back(u);
  }
  for (int i = 1; i <= n; i++) {
    if (vis[i] == 0) {
      if (dfs(i, 1)) break;
    }
  }
  cout << ans.size() << endl;
  for (auto it : ans) cout << it << " ";
}
int main() {
  int tt = 1;
  int cas = 1;
  while (tt--) {
    solve();
  }
}
