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.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;


public class D161 {
    
    static StringTokenizer st;
    static BufferedReader in;
    static boolean[]used;
    static ArrayList<Integer>[]g;
    static int[]p, dis;
    static PrintWriter pw;
    static int k;
    
    public static void main(String[] args) throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
        int n = nextInt();
        int m = nextInt();
        k = nextInt();
        p = new int[n+1];
        dis = new int[n+1];
        g = new ArrayList[n+1];
        for (int i = 1; i <= n; i++) {
            g[i] = new ArrayList<Integer>();
        }
        used = new boolean[n+1];
        for (int i = 1; i <= m; i++) {
            int v1 = nextInt();
            int v2 = nextInt();
            g[v1].add(v2);
            g[v2].add(v1);
        }
        boolean[]used = new boolean[n+1];
        for (int i = 1; i <= n; i++) {
            if (!used[i]) {
                dfs(i);
            }
        }
        pw.close();
    }
    private static void dfs(int v) {
        used[v] = true;
        boolean found = false;
        for (int to : g[v]) {
            if (to==p[v])
                continue;
            if (!used[to]) {
                p[to] = v;
                dis[to] = dis[v]+1;
                found = true;
                dfs(to);
            }
        }
        if (!found && dis[v] >= k) {
            for (int to : g[v]) {
                if (dis[v]-dis[to] >= k) {
                    int cur = v;
                    pw.println(dis[v]-dis[to]+1);
                    while (true) {
                        pw.print(cur+" ");
                        if (cur==to)
                            break;
                        cur = p[cur];
                    }
                    pw.close();
                    System.exit(0);
                }
            }
        }
    }
    private static int nextInt() throws IOException{
        return Integer.parseInt(next());
    }
    
    private static long nextLong() throws IOException{
        return Long.parseLong(next());
    }
    
    private static double nextDouble() throws IOException{
        return Double.parseDouble(next());
    }
    
    private static String next() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
}
