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 Task263d{
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }
}

class Task{
    private List<Integer>[] g;
    private int[] dist, par;
    private boolean[] vis, inLoop;
    private ArrayList<Integer> res;
    private int k, cycle, end;
    

    private void dfs(int root, int p){
        if (vis[root]){
            if (Math.abs(dist[root] - dist[p]) >= k){
                inLoop[root] = true;
                cycle = p;
                end = root;
            }
            return ;
        }
        vis[root] = true;
        for (int v : g[root]){
            if (v == p) continue;
            if (vis[v] == false){
                dist[v] = Math.max(dist[v], dist[root] + 1);
                par[v] = root;
            }
            if (cycle == 0)
                dfs(v, root);
        }
    }

    public void getPath(int r){
        res.add(r);
        if (par[r] != r && r != end)
            getPath(par[r]);
    }
    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int n = in.nextInt();
        int m = in.nextInt();
        k = in.nextInt();
        g = new List[n+1];
        dist = new int[n+1];
        vis = new boolean[n+1];
        inLoop = new boolean[n+1];
        res = new ArrayList<>();
        par = new int[n+1];
        cycle = 0;
        for (int i = 0; i<=n ;i++){
            g[i] = new ArrayList<>();
        }
        for (int i = 0; i<m; i++){
            int u = in.nextInt();
            int v = in.nextInt();
            g[u].add(v);
            g[v].add(u);
        }
        for (int i = 1; i<=n && cycle == 0; i++){
            if (vis[i] == false){
                par[i] = i;
                dfs(i, i);
            }
        }
        getPath(cycle);
        System.out.println(res.size());
        for (int v : res)
            System.out.print(v + " ");
        System.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());
    }
}