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 


/**
 *
 * @author sarthak
 */

import java.util.*;
import java.math.*;
import java.io.*;



public class rnd161_D {

    static ArrayList<Integer>[] g;
    static int[] PA;
    static int[] vis;
    static boolean fll=true;
    static HashMap<Integer, HashMap<Integer,Integer>> mp=new HashMap<>();
    static ArrayList<Integer> al=new ArrayList<>();
    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(InputStream is) {
            br = new BufferedReader(new InputStreamReader(is));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public String nextLine() {
            st = null;
            try {
                return br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }
    public static void dfs(int v){
        if(fll){
        vis[v]=1;
        al.add(v);
        boolean fl=true;
            for(int ad:g[v])
                if(vis[ad]==0){
                    fl=false;
                    dfs(ad);
                }
      if(fl){
          int FI=0;//first index
          for(int i=0;i<al.size();i++){
              if(mp.get(v).containsKey(al.get(i)))
              {
                  FI=i;break;
              }
          }
          System.out.println((al.size()-FI));
          for(int i=FI;i<al.size();i++)
              System.out.print(al.get(i)+" ");
          System.out.println();
          fll=false;
          return;
          
       }
        al.remove(al.size()-1);
        
        
        
        }
    }

    public static void main(String[] args){
         
    FastScanner s = new FastScanner(System.in);
    int n=s.nextInt();
    int m=s.nextInt();
   int k=s.nextInt();
    g=new ArrayList[n+1];
    vis=new int[n+1];PA=new int[n+1];
    for(int i=1;i<=m;i++){
        int u=s.nextInt();
        int v=s.nextInt();
        if(g[u]==null){g[u]=new ArrayList<>();mp.put(u, new HashMap<>());}
        if(g[v]==null){g[v]=new ArrayList<>();mp.put(v,new HashMap<>());}
        g[u].add(v);
        g[v].add(u);
        mp.get(u).put(v, 0);
        mp.get(v).put(u, 0);
        
        
    }
    for(int i=1;i<=n;i++)
       if(vis[i]==0){
           al=new ArrayList<>();
             dfs(i);
             
       }
    
    }


}
