You've got a undirected graph G, consisting of n nodes. We will consider the nodes of the graph indexed by integers from 1 to n. We know that each node of graph G is connected by edges with at least k other nodes of this graph. Your task is to find in the given graph a simple cycle of length of at least k + 1.

A simple cycle of length d (d > 1) in graph G is a sequence of distinct graph nodes v1, v2, ..., vd such, that nodes v1 and vd are connected by an edge of the graph, also for any integer i (1 ≤ i < d) nodes vi and vi + 1 are connected by an edge of the graph.

Input

The first line contains three integers n, m, k (3 ≤ n, m ≤ 105; 2 ≤ k ≤ n - 1) — the number of the nodes of the graph, the number of the graph's edges and the lower limit on the degree of the graph node. Next m lines contain pairs of integers. The i-th line contains integers ai, bi (1 ≤ ai, bi ≤ n; ai ≠ bi) — the indexes of the graph nodes that are connected by the i-th edge. 

It is guaranteed that the given graph doesn't contain any multiple edges or self-loops. It is guaranteed that each node of the graph is connected by the edges with at least k other nodes of the graph.

Output

In the first line print integer r (r ≥ k + 1) — the length of the found cycle. In the next line print r distinct integers v1, v2, ..., vr (1 ≤ vi ≤ n) — the found simple cycle.

It is guaranteed that the answer exists. If there are multiple correct answers, you are allowed to print any of them.

Examples

Input

3 3 2
1 2
2 3
3 1


Output

3
1 2 3 

Input

4 6 3
4 3
1 2
1 3
1 4
2 3
2 4


Output

4
3 4 1 2 
import java.io.*;
import java.math.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;

public class Main
{    
   public static void main(String[] args) throws IOException
   {
      new Main().run();
   }

   StreamTokenizer in;
   PrintWriter out;
//deb////////////////////////////////////////////////
    public static void deb(String n ,Object n1){
     System.out.println(n+" is : "+n1);
 }  
    public static void deb(int[] A){
       
        for (Object oo : A) {
            System.out.print(oo+" ");
        }
        System.out.println("");
 }
     public static void deb(long[] A){
       
        for (Object oo : A) {
            System.out.print(oo+" ");
        }
        System.out.println("");
 }
      public static void deb(String[] A){
       
        for (Object oo : A) {
            System.out.print(oo+" ");
        }
        System.out.println("");
 }
      public static void deb(int[][] A){
          for (int i = 0; i < A.length; i++) {
               for (Object oo : A[i]) {
            System.out.print(oo+" ");
        }
        System.out.println("");
          }
       
 }
        public static void deb(long[][] A){
          for (int i = 0; i < A.length; i++) {
               for (Object oo : A[i]) {
            System.out.print(oo+" ");
        }
        System.out.println("");
          }
       
 }
          public static void deb(String[][] A){
          for (int i = 0; i < A.length; i++) {
               for (Object oo : A[i]) {
            System.out.print(oo+" ");
        }
        System.out.println("");
          }
       
 }
      /////////////////////////////////////////////////////////////
   int nextInt() throws IOException
   {
      in.nextToken();
      return (int)in.nval;
   }
   long nextLong() throws IOException
   {
      in.nextToken();
      return (long)in.nval;
   }
   
   void run() throws IOException
   {
  //   in = new StreamTokenizer(new BufferedReader(new FileReader("input.txt")));
    //  out = new PrintWriter(new FileWriter("output.txt"));
     in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
   out = new PrintWriter(new OutputStreamWriter(System.out));
      solve();
      out.flush();
   }
 
   void solve() throws IOException
   {  int n=nextInt(),m=nextInt(),k=nextInt();
   k++;
   node[] A= new node[n];
    Boolean[] vis= new Boolean[n];
       for (int i = 0; i < n; i++) {
           vis[i]=false;
           A[i]= new node();
       }
   int x,y;
       for (int i = 0; i < m; i++) {
        x=nextInt();y=nextInt();
        A[x-1].edges.add(y-1);
        A[y-1].edges.add(x-1);
        
       }
  A[0].from=-10;
  A[0].iter=1;
  
 
 int cur=0;
  int kk=0,st=-1;vis[0]=true;
  int it=1,len=-1,stt=-1,end=-1;
  while(kk==0){
    //  System.out.println(cur+" sdhkjfds");
      it++;
  
       {
          for (int newnode : A[cur].edges) {
              if(vis[newnode]){
              if(it-A[newnode].iter>=k){
              len=it-A[newnode].iter;
              kk=1;
              end=cur;stt=newnode;
              }
              }
              else{
              vis[newnode]=true;
              A[newnode].from=cur;
              A[newnode].iter=it;
              cur=newnode;
              break;
              }
          if(kk==1)break;
          }
     if(kk==1)break; }
  
  }
     //  System.out.println(end+"   "+stt);
       out.println(len);
       int nodes=end;
       while(true)
       {  out.print((nodes+1)+" ");
       nodes= A[nodes].from;
       if(nodes==stt)break;
       }  
      out.println((stt+1));
   }}
class node {
public ArrayList<Integer> edges= new ArrayList<Integer>();
public int iter=-1;
public int from=-1;


}