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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class Main {
	public static BufferedReader in;
	public static PrintWriter out;

	public static void main(String[] args) throws IOException {
		in = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);

		boolean showLineError = true;
		if (showLineError) {
			solve();
			out.close();
		} else {
			try {
				solve();
			} catch (Exception e) {
			} finally {
				out.close();
			}
		}

	}

	static void debug(Object... os) {
		out.println(Arrays.deepToString(os));
	}

	private static void solve() throws IOException {
		String[] line = in.readLine().split(" ");
		int n = Integer.parseInt(line[0]);
		int m = Integer.parseInt(line[1]);
		int k = Integer.parseInt(line[2]);

		List<Integer>[] g = (List<Integer>[]) new List[n];
		for (int i = 0; i < n; i++)
			g[i] = new ArrayList<Integer>();
		for (int i = 0; i < m; i++) {
			line = in.readLine().split(" ");
			int u = Integer.parseInt(line[0]) - 1;
			int v = Integer.parseInt(line[1]) - 1;
			g[u].add(v);
			g[v].add(u);
		}
		boolean[] seen = new boolean[n];
		seen[0] = true;
		List<Integer> path = new ArrayList<Integer>();
		path.add(0);
		while (path.size() != k+1) {
			int last = path.get(path.size() - 1);
			for (int v : g[last])
				if (!seen[v]) {
					seen[v] = true;
					path.add(v);
					break;
				}

		}
		boolean[] forb = new boolean[n];
		for (int i = 1; i < path.size(); i++)
			forb[path.get(i)] = true;
		while (true) {
			int last = path.get(path.size() - 1);
			for (int v : g[last])
				if (!forb[v]) {
					path.add(v);
					forb[v] = true;
					if (seen[v]) {
						int index = -1;
						for (int i = 0; i < path.size() - 1; i++)
							if (path.get(i) == v) {
								index = i;
								break;
							}
						List<Integer> cycle = path.subList(index, path.size());
						show(cycle);
						return;

					} else {
						seen[v] = true;
						forb[path.get(path.size() - k-1)] = false;
						break;
					}
				}

		}
	}

	private static void show(List<Integer> cycle) {
		out.println(cycle.size() - 1);
		for (int i = 0; i < cycle.size() - 1; i++) {
			if (i == 0) {
				out.print(cycle.get(0)+1);
			} else {
				out.print(" " + (cycle.get(i)+1));
			}
		}
		out.println();

	}
}