Problem: The evil Bumbershoot corporation produces clones for gruesome experiments in a vast underground lab. On one occasion, the corp cloned a boy Andryusha who was smarter than his comrades. Immediately Andryusha understood that something fishy was going on there. He rallied fellow clones to go on a feud against the evil corp, and they set out to find an exit from the lab. The corp had to reduce to destroy the lab complex.

The lab can be pictured as a connected graph with n vertices and m edges. k clones of Andryusha start looking for an exit in some of the vertices. Each clone can traverse any edge once per second. Any number of clones are allowed to be at any vertex simultaneously. Each clone is allowed to stop looking at any time moment, but he must look at his starting vertex at least. The exit can be located at any vertex of the lab, hence each vertex must be visited by at least one clone.

Each clone can visit at most <image> vertices before the lab explodes.

Your task is to choose starting vertices and searching routes for the clones. Each route can have at most <image> vertices.

Input

The first line contains three integers n, m, and k (1 ≤ n ≤ 2·105, n - 1 ≤ m ≤ 2·105, 1 ≤ k ≤ n) — the number of vertices and edges in the lab, and the number of clones.

Each of the next m lines contains two integers xi and yi (1 ≤ xi, yi ≤ n) — indices of vertices connected by the respective edge. The graph is allowed to have self-loops and multiple edges.

The graph is guaranteed to be connected.

Output

You should print k lines. i-th of these lines must start with an integer ci (<image>) — the number of vertices visited by i-th clone, followed by ci integers — indices of vertices visited by this clone in the order of visiting. You have to print each vertex every time it is visited, regardless if it was visited earlier or not.

It is guaranteed that a valid answer exists.

Examples

Input

3 2 1
2 1
3 1


Output

3 2 1 3


Input

5 4 2
1 2
1 3
1 4
1 5


Output

3 2 1 3
3 4 1 5

Note

In the first sample case there is only one clone who may visit vertices in order (2, 1, 3), which fits the constraint of 6 vertices per clone.

In the second sample case the two clones can visited vertices in order (2, 1, 3) and (4, 1, 5), which fits the constraint of 5 vertices per clone.

Solution (in JAVA):

Solution:
//package Round403;


import java.util.*;
import java.lang.*;
import java.io.*;

/*
 * 
 * Comments Here
 * 
 */
public class E
{
	
	static HashMap<Integer, ArrayList<Integer>> edges;
	static ArrayList<Integer> visits;
	static HashSet<Integer> visited;
	public static void main(String[] args) throws java.lang.Exception
	{
		//Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    	//Uncomment to read from file
    	/*
    	File file = new File("src/in.txt");
		try {
			in = new Scanner(file);
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		/**/
		
		StringTokenizer st = new StringTokenizer(br.readLine());
		
		int n = Integer.parseInt(st.nextToken());
		int m = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		
		edges = new HashMap<Integer,ArrayList<Integer>>();
		for(int i = 0; i < m; ++i) {
			st = new StringTokenizer(br.readLine());
			addEdge(Integer.parseInt(st.nextToken()),Integer.parseInt(st.nextToken()));
		}
		
		visited = new HashSet<Integer>();
		visits = new ArrayList<Integer>();
		
		if(n > 1) {
			dfs(1);
		} else {
			System.out.println("1 1");
			return;
		}
		
		final int maxVisits = (int)Math.ceil(n*2.0/k);
		
		int index = 0;
		int numClones = 0;
		
		PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
		while(index < visits.size()) {
			int numVisits = Math.min(maxVisits, visits.size()-index);
			out.write(""+numVisits + " ");
			for(int i = 0; i < numVisits; ++i) {
				int tempIndex = index+i;
				out.write(""+visits.get(tempIndex) + " ");
			}
			out.write("\n");
			index += numVisits;
			++numClones;
		}
		
		while(numClones < k) {
			out.write(1 + " " + 1+"\n");
			numClones++;
		}
		out.flush();
		out.close();
		
		//in.close();
		br.close();
	}
	

	static void dfs(int index) {
		if(visited.contains(index)) {
			visits.add(index);
			return;
		}
		visited.add(index);
		visits.add(index);
		for(int next : edges.get(index)){
			if(!visited.contains(next)) {
				dfs(next);
				visits.add(index);
			}
		}
	}
	
	static void addEdge(int start, int end) {
		
		if(start == end) {
			return;
		}
		
		if(edges.containsKey(start)) {
			edges.get(start).add(end);
		} else {
			ArrayList<Integer> added = new ArrayList<Integer>();
			added.add(end);
			edges.put(start, added);
		}
		
		
		if(edges.containsKey(end)) {
			edges.get(end).add(start);
		} else {
			ArrayList<Integer> added = new ArrayList<Integer>();
			added.add(start);
			edges.put(end, added);
		}
		
	}
	
}