#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000 * 100;
int mark[MAX_N];
int n, m, k, tst = -1, o = 0;
vector<int> adj[MAX_N];
vector<int> ans;
int dfs(int v, int c) {
  mark[v] = c;
  for (int i = 0; i < adj[v].size(); i++) {
    if (mark[adj[v][i]] == 0) {
      int p = dfs(adj[v][i], c + 1);
      if (p == 1) {
        if (v == tst) {
          return 0;
        }
        ans.push_back(v + 1);
        return 1;
      } else
        return 0;
    } else if (mark[v] - mark[adj[v][i]] >= k && tst < 0) {
      ans.push_back(adj[v][i] + 1);
      ans.push_back(v + 1);
      tst = adj[v][i];
      return 1;
    }
  }
  return 0;
}
int main() {
  cin >> n >> m >> k;
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  cout << endl << endl;
  for (int i = 0; i < n; i++) {
    if (mark[i] == 0) {
      dfs(i, 1);
    }
  }
  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  return 0;
}
