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.util.List;
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.LinkedList;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author lgsmitty
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskD solver = new TaskD();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskD {
    public void solve(int testNumber, Scanner in, PrintWriter out) {

        final int n = in.nextInt();
        final int m = in.nextInt();
        final int k = in.nextInt();

        ArrayList<ArrayList<Integer>> g = new ArrayList<ArrayList<Integer>>(n + 1);
        for (int i = 0; i <= n; ++i) {
            g.add(new ArrayList<Integer>(k + 1));
        }

        int eNum = 0;
        for (int i = 0; i < m; ++i) {

            final int from = in.nextInt();
            final int to = in.nextInt();

            g.get(from).add(to);
            g.get(to).add(from);
        }

        final int pos[] = new int[n + 1];
        final int que[] = new int[n + 1];
        final boolean used[] = new boolean[n + 1];

        int qStart = 0;
        int qEnd = 1;
        pos[1] = 0;
        que[0] = 1;

        while (qStart < qEnd) {

            final int v = que[qStart++];
            used[v] = true;
            boolean found = false;

            for (int u : g.get(v)) {

                if (!used[u]) {
                    used[u] = true;
                    pos[u] = qEnd;
                    que[qEnd++] = u;
                    found = true;
                    break;
                }
            }

            if (!found) {

                int minPos = qEnd;

                for (int u : g.get(v)) {

                    if (qStart - pos[u] >= k + 1) {

                        out.println(qStart - pos[u]);
                        for (int i = pos[u]; i < qStart; ++i) {
                            out.print(que[i]);
                            out.print(" ");
                        }
                        out.println();
                        return;
                    }
                }
            }
        }
    }
}
