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.util.*;

public class cf161d {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }
}

class TaskA {
    ArrayList<ArrayList<Integer>> graph;
    Stack<Integer> s;
    int status,ans,total_length;
    int[] mark,cycle_length;
    public void dfs(int num,int length,int k){
        s.push(num);
        cycle_length[num] = length;
        mark[num] = 1;
        for (int i = 0; i<graph.get(num).size(); i++){
            int neighbour = graph.get(num).get(i);
            // System.out.println(num+" "+neighbour+" "+mark[neighbour]+" "+length+" "+cycle_length[neighbour]);
            if (mark[neighbour] == 1 && length-cycle_length[neighbour] >= k){
                ans = neighbour;
                total_length = length - cycle_length[neighbour] + 1;
                // System.out.println(total_length);
                status = 1;
                return;
            }
            if (mark[neighbour] == 0)
                dfs(neighbour,length+1,k);
            if (status == 1)
                return;
        }
    }
    public void solve(int testCase,InputReader in,PrintWriter out){
        int n = in.nextInt(),m = in.nextInt(),k = in.nextInt();
        graph = new ArrayList<>();
        total_length = 0;
        for (int i = 0; i<=n; i++)
            graph.add(new ArrayList<Integer>());
        for (int i = 0; i<m; i++)
        {
            int a = in.nextInt(),b = in.nextInt();
            graph.get(a).add(b);
            graph.get(b).add(a);
        }
        s = new Stack<Integer>();
        mark = new int[n+9];
        cycle_length = new int[n+9];
        status = 0;
        dfs(1,1,k);
        out.println(total_length);
        while (!s.empty()){
            out.print(s.peek()+" ");
            if (s.peek() == ans)
                break;
            s.pop();
        }
        
        //123
        out.println();
    }
}

class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }
    public long nextLong() {
        return Long.parseLong(next());
    }
    public double nextDouble() {
        return Double.parseDouble(next());
    }
}