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 
/*
 * still have no idea what i am doing
 */


import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.StringTokenizer;

public class Main
{

	public static void main(String[] args) throws IOException
	{
		Main main = new Main();
		main.read();
	}

	/* IO */
	private StringBuilder ans;
	private BufferedReader in;
	private StringTokenizer tok;

	/* fields */
	private int n;
	private int m;
	private int k;
	private Node[] nodes;
	private boolean[] visited;
	private int[] prev;
	private int cycleEnd;
	private int cycleCount;
	private int[] level;

	private void read() throws IOException
	{
		// streams
		boolean file = false;
		if (file)
			in = new BufferedReader(new FileReader("input.txt"));
		else
			in = new BufferedReader(new InputStreamReader(System.in));
		ans = new StringBuilder();

		// read input
		tok = new StringTokenizer(in.readLine());
		n = Integer.parseInt(tok.nextToken());
		m = Integer.parseInt(tok.nextToken());
		k = Integer.parseInt(tok.nextToken());
		nodes = new Node[n];
		for (int i = 0; i < n; i++)
			nodes[i] = new Node(i);

		// make edges
		for (int i = 0; i < m; i++)
		{
			tok = new StringTokenizer(in.readLine());
			int s = Integer.parseInt(tok.nextToken()) - 1;
			int t = Integer.parseInt(tok.nextToken()) - 1;
			nodes[s].next.add(nodes[t]);
			nodes[t].next.add(nodes[s]);
		}

		solve();
		System.out.println(ans.toString().trim());
	}

	private void solve()
	{
		// dfs to get the end of the cycle
		cycleEnd = -1;
		visited = new boolean[n];
		prev = new int[n];
		level = new int[n];
		Arrays.fill(prev, -1);
		for (int i = 0; i < n; i++)
			if (!visited[i])
			{
				visited[i] = true;
				level[i] = 1;
				dfs(nodes[i], 1);
			}

		// form the cycle
		StringBuilder strb = new StringBuilder();
		int count = 0;
		while (count < cycleCount)
		{
			count++;
			strb.append((cycleEnd + 1) + " ");
			cycleEnd = prev[cycleEnd];
		}
		ans.append(cycleCount + "\n");
		ans.append(strb.toString().trim());

	}

	private void dfs(Node node, int count)
	{
		for (Node next : node.next)
			if (!visited[next.id])
			{
				visited[next.id] = true;
				prev[next.id] = node.id;
				level[next.id] = count + 1;
				dfs(next, count + 1);
			} else
			{
				if (level[next.id] - level[node.id] >= k)
				{
					cycleEnd = next.id;
					cycleCount = level[next.id] - level[node.id] + 1;
				}
			}
				
	}

}

class Node
{
	int id;
	LinkedList<Node> next;

	public Node(int id)
	{
		this.id = id;
		this.next = new LinkedList<>();
	}

	public String toString()
	{
		return "" + id;
	}
}