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.DataInputStream;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.TreeMap;

public class CycleInGraph {
	static int [] cycle ;
	static int cyc;
	static boolean ch [] ;
	static int K;
	static int cs;
	static int ce;
	static TreeMap<Integer, ArrayList<Integer>> w;
	static int [] ind ;
	public static void main(String [] args) throws Exception{
		FS in = new FS(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int n = in.nextInt();
		int m = in.nextInt();
		K = in.nextInt();
		cycle = new int[n+2];
		ch = new boolean[n];
		ind = new int[n+1];
		w = new TreeMap<>();
		for(int i = 0 ; i < m ; i++){
			int j = in.nextInt()-1;
			int z = in.nextInt()-1;
			if(w.get(j)==null){
				ArrayList<Integer> a = new ArrayList<>();
				a.add(z);
				w.put(j	, a );
			}
			else{
				w.get(j).add(z);
			}
			if(w.get(z)==null){
				ArrayList<Integer> a = new ArrayList<>();
				a.add(j);
				w.put(z	, a );
			}
			else{
				w.get(z).add(j);
			}
		}
		for(int h = 0 ; h < n ; h++){
			try{
				if(!ch[h])
				DFS(h,0);
			}
			catch (Exception e) {
				out.println(ce - cs);
				for(int i= cs ; i < ce ; i++){
					out.print((cycle[i]+1)+" ");
				}
				out.close();
				return ;
			}
		}
		
		
	}
	public static void DFS(int x , int k){
		if(ch[x]){
			if(k-ind[x]>K){
				cyc= x;
				cs = ind[x];
				ce = k;
				throw new NullPointerException();
			}
			return;
		}
		ch[x]=true;
		ind[x]=k;
		cycle[k]=x;
		ArrayList<Integer> a = w.get(x);
		for(int i : a){
			w.get(i).remove((Object)x);
			DFS(i , k+1);
		}
	}
}
class FS
{
   final private int BUFFER_SIZE = 1 << 17;

   private DataInputStream din;
   private byte[] buffer;
   private int bufferPointer, bytesRead;

   public FS(InputStream in)
   {
      din = new DataInputStream(in);
      buffer = new byte[BUFFER_SIZE];
      bufferPointer = bytesRead = 0;
   }
   public String nextString() throws Exception
   {
       StringBuffer sb=new StringBuffer("");
       byte c = read();
       while (c <= ' ') c = read();
       do
       {
           sb.append((char)c);
           c=read();
       }while(c>' ');
       return sb.toString();
   }
   public char nextChar() throws Exception
   {
       byte c=read();
       while(c<=' ') c= read();
       return (char)c;
   }
   public int nextInt() throws Exception
   {
      int ret = 0;
      byte c = read();
      while (c <= ' ') c = read();
      boolean neg = c == '-';
      if (neg) c = read();
      do
      {
          ret = ret * 10 + c - '0';
         c = read();
      } while (c > ' ');
      if (neg) return -ret;
      return ret;
   }
   public long nextLong() throws Exception
   {
      long ret = 0;
      byte c = read();
      while (c <= ' ') c = read();
      boolean neg = c == '-';
      if (neg) c = read();
      do
      {
          ret = ret * 10 + c - '0';
         c = read();
      } while (c > ' ');
      if (neg) return -ret;
      return ret;
   }
   private void fillBuffer() throws Exception
   {
      bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
      if (bytesRead == -1) buffer[0] = -1;
   }

   private byte read() throws Exception
   {
      if (bufferPointer == bytesRead) fillBuffer();
      return buffer[bufferPointer++];
   }
}   

