Problem: Given a connected undirected graph with n vertices and an integer k, you have to either:

  * either find an independent set that has exactly ⌈k/2⌉ vertices.
  * or find a simple cycle of length at most k. 



An independent set is a set of vertices such that no two of them are connected by an edge. A simple cycle is a cycle that doesn't contain any vertex twice. 

I have a proof that for any input you can always solve at least one of these problems, but it's left as an exercise for the reader.

Input

The first line contains three integers n, m, and k (3 ≤ k ≤ n ≤ 10^5, n-1 ≤ m ≤ 2 ⋅ 10^5) — the number of vertices and edges in the graph, and the parameter k from the statement.

Each of the next m lines contains two integers u and v (1 ≤ u,v ≤ n) that mean there's an edge between vertices u and v. It's guaranteed that the graph is connected and doesn't contain any self-loops or multiple edges.

Output

If you choose to solve the first problem, then on the first line print 1, followed by a line containing ⌈k/2⌉ distinct integers not exceeding n, the vertices in the desired independent set.

If you, however, choose to solve the second problem, then on the first line print 2, followed by a line containing one integer, c, representing the length of the found cycle, followed by a line containing c distinct integers not exceeding n, the vertices in the desired cycle, in the order they appear in the cycle.

Examples

Input


4 4 3
1 2
2 3
3 4
4 1


Output


1
1 3 

Input


4 5 3
1 2
2 3
3 4
4 1
2 4


Output


2
3
2 3 4 

Input


4 6 3
1 2
2 3
3 4
4 1
1 3
2 4


Output


2
3
1 2 3 

Input


5 4 5
1 2
1 3
2 4
2 5


Output


1
1 4 5 

Note

In the first sample:

<image>

Notice that printing the independent set \{2,4\} is also OK, but printing the cycle 1-2-3-4 isn't, because its length must be at most 3.

In the second sample:

<image>

Notice that printing the independent set \{1,3\} or printing the cycle 2-1-4 is also OK.

In the third sample:

<image>

In the fourth sample:

<image>

Solution (in JAVA):

Solution:
import java.util.*;

public class Ehab {
    static ArrayList<Integer>[] colors;
    static ArrayList<Integer> currPath = new ArrayList<>();
    static ArrayList<Integer> cycle = new ArrayList<>();
    static int[] distance;
    public static void main(String[] args){
        Scanner scanner = new Scanner(System.in);
        int nodes = scanner.nextInt();
        int edges = scanner.nextInt();
        int k = scanner.nextInt();
        ArrayList<Integer>[] graph = new ArrayList[nodes];
        for(int i = 0;i<nodes;i++){
            graph[i] = new ArrayList<>();
        }
        //building our graph
        while(edges-->0){
            int src = scanner.nextInt()-1;
            int dest = scanner.nextInt()-1;
            graph[src].add(dest);
            graph[dest].add(src);
        }
        colors =  new ArrayList[2];
        for(int i = 0;i<2;i++){
            colors[i] = new ArrayList<>();
        }
        distance = new int[nodes];
        DFS(0,graph,new boolean[nodes],0);
        StringBuilder result = new StringBuilder();
        //if there is no cycle
        if(cycle.isEmpty()){
            System.out.println(1);
            //find the bigger cluster
            if(colors[0].size()>colors[1].size()){
                for(int i = 0;i<(k+1)/2;i++){
                    result.append(colors[0].get(i)+1+" ");
                }
            }else{
                for(int i = 0;i<(k+1)/2;i++){
                    result.append(colors[1].get(i)+1+" ");
                }
            }
        }
        else {
            if(cycle.size() > k) {
                System.out.println(1);
                for(int i = 0; i < k; i+=2) {
                    result.append(cycle.get(i)+1 + " ");
                }
            }
            else {
                System.out.println(2);
                System.out.println(cycle.size());
                for(int i : cycle) {
                    result.append(i+1 + " ");
                }
            }
        }
        System.out.println(result);

    }
    private static boolean DFS(int node,ArrayList<Integer>[] graph,boolean[] visited,int dist){

        distance[node] = dist;
        colors[dist%2].add(node);
        int best = Integer.MAX_VALUE;
        visited[node] = true;
        currPath.add(node);
        for(int neighbour:graph[node]){
            if(visited[neighbour] && distance[node]-distance[neighbour]>1){
                best = Math.min(best,distance[neighbour]);
            }
        }
        if(best != Integer.MAX_VALUE){
            for(int i = best;i<=distance[node];i++){
                cycle.add(currPath.get(i));
            }
            return true;
        }
        for(int neighbour:graph[node]){
            if(!visited[neighbour]){
                if(DFS(neighbour,graph,visited,dist+1)){
                    return true;
                }
            }
        }
        currPath.remove(currPath.size()-1);
        return false;
    }
}