#include <bits/stdc++.h>
using namespace std;
void Get(int &Ret) {
  char CH;
  bool FL = 0;
  for (; CH = getchar(), CH < '0' || CH > '9';)
    if (CH == '-') FL = 1;
  for (Ret = CH - '0'; CH = getchar(), CH >= '0' && CH <= '9';
       Ret = Ret * 10 + CH - '0')
    ;
  FL && (Ret = -Ret);
}
void Get(long long &Ret) {
  char CH;
  bool FL = 0;
  for (; CH = getchar(), CH < '0' || CH > '9';)
    if (CH == '-') FL = 1;
  for (Ret = CH - '0'; CH = getchar(), CH >= '0' && CH <= '9';
       Ret = Ret * 10 + CH - '0')
    ;
  FL && (Ret = -Ret);
}
const int MAXN = 220000;
struct node {
  int v;
  node *next;
};
node Edge[MAXN * 2];
node *Ecnt = &Edge[0];
node *adj[MAXN];
inline void addedge(int u, int v) {
  node *p = ++Ecnt;
  p->v = v;
  p->next = adj[u];
  adj[u] = p;
}
int n, m, cnt;
void Read() {
  Get(n);
  Get(m);
  Get(cnt);
  int i;
  for (i = 1; i <= m; i++) {
    int u, v;
    Get(u);
    Get(v);
    addedge(u, v);
    addedge(v, u);
  }
  for (i = 1; i <= n; i++) addedge(0, i);
}
bool vis[MAXN];
int path[MAXN];
int dep[MAXN];
void Print(int a, int d) {
  int i;
  printf("%d\n", d - a + 1);
  for (i = a; i < d; i++) printf("%d ", path[i]);
  printf("%d\n", path[d]);
}
void DFS(int u, int d) {
  path[d] = u;
  vis[u] = true;
  dep[u] = d;
  vector<int> rec;
  for (node *p = adj[u]; p; p = p->next) {
    if (vis[p->v] == false)
      rec.push_back(p->v);
    else if (d - dep[p->v] + 1 >= cnt + 1) {
      Print(dep[p->v], d);
      exit(0);
    }
  }
  random_shuffle(rec.begin(), rec.end());
  int len = rec.size();
  for (int i = 0; i < len; i++) DFS(rec[i], d + 1);
  vis[u] = false;
}
int main() {
  Read();
  DFS(0, 0);
  return 0;
}
