Problem: One day Polycarpus stopped by a supermarket on his way home. It turns out that the supermarket is having a special offer for stools. The offer is as follows: if a customer's shopping cart contains at least one stool, the customer gets a 50% discount on the cheapest item in the cart (that is, it becomes two times cheaper). If there are several items with the same minimum price, the discount is available for only one of them!

Polycarpus has k carts, and he wants to buy up all stools and pencils from the supermarket. Help him distribute the stools and the pencils among the shopping carts, so that the items' total price (including the discounts) is the least possible.

Polycarpus must use all k carts to purchase the items, no shopping cart can remain empty. Each shopping cart can contain an arbitrary number of stools and/or pencils.

Input

The first input line contains two integers n and k (1 ≤ k ≤ n ≤ 103) — the number of items in the supermarket and the number of carts, correspondingly. Next n lines describe the items as "ci ti" (without the quotes), where ci (1 ≤ ci ≤ 109) is an integer denoting the price of the i-th item, ti (1 ≤ ti ≤ 2) is an integer representing the type of item i (1 for a stool and 2 for a pencil). The numbers in the lines are separated by single spaces.

Output

In the first line print a single real number with exactly one  decimal place — the minimum total price of the items, including the discounts.

In the following k lines print the descriptions of the items in the carts. In the i-th line print the description of the i-th cart as "t b1 b2 ... bt" (without the quotes), where t is the number of items in the i-th cart, and the sequence b1, b2, ..., bt (1 ≤ bj ≤ n) gives the indices of items to put in this cart in the optimal distribution. All indices of items in all carts should be pairwise different, each item must belong to exactly one cart. You can print the items in carts and the carts themselves in any order. The items are numbered from 1 to n in the order in which they are specified in the input.

If there are multiple optimal distributions, you are allowed to print any of them.

Examples

Input

3 2
2 1
3 2
3 1


Output

5.5
2 1 2
1 3


Input

4 3
4 1
1 2
2 2
3 2


Output

8.0
1 1
2 4 2
1 3

Note

In the first sample case the first cart should contain the 1st and 2nd items, and the second cart should contain the 3rd item. This way each cart has a stool and each cart has a 50% discount for the cheapest item. The total price of all items will be: 2·0.5 + (3 + 3·0.5) = 1 + 4.5 = 5.5.

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;
public class Solution{

	public static Integer INT(String s){
		return Integer.parseInt(s);
	}

	public static Long LONG(String s){
		return Long.parseLong(s);
	}

	//====================================================================================================================


	static class Pair implements Comparable<Pair>{
		int cost, index;
		Pair(int cost, int index){
			this.cost=cost;
			this.index=index;
		}

		public int compareTo(Pair obj){
			return this.cost-obj.cost;
		}
	}


	public static void main(String args[])throws IOException{

		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));	Scanner in=new Scanner(System.in);	StringBuilder out=new StringBuilder();

		String line[]=br.readLine().split("\\s");
		int n=INT(line[0]),
			k=INT(line[1]);

		ArrayList<Pair> type[]=new ArrayList[3];
		for(int i=0; i<=2; i++)	type[i]=new ArrayList<>();

		for(int i=1; i<=n; i++){
			line=br.readLine().split("\\s");
			int c=INT(line[0]),
				t=INT(line[1]);
			type[t].add(new Pair(c, i));
		}

		Collections.sort(type[1], Collections.reverseOrder());
		Collections.sort(type[2]);

		int min_cost[]=new int[k], i_1=0, i_2=0;
		Arrays.fill(min_cost, -1);
		double total_cost=0;
		ArrayList<Integer> item[]=new ArrayList[k];

		for(int i=0; i<k; i++){
			item[i]=new ArrayList<>();

			if(i_1!=type[1].size()){
				Pair temp=type[1].get(i_1++);
				item[i].add(temp.index);
				if(i==k-1)
					total_cost+=temp.cost;
				else
					total_cost+=(double)temp.cost/2.0;
				min_cost[i]=temp.cost;
			}
			else{
				Pair temp=type[2].get(i_2++);
				item[i].add(temp.index);
				total_cost+=temp.cost;
			}
		}

		while(i_1!=type[1].size()){
			Pair temp=type[1].get(i_1++);
			item[k-1].add(temp.index);
			total_cost+=temp.cost;
			min_cost[k-1]=temp.cost;
		}

		int i=0, j;
		for(j=type[2].size()-1; j>=i_2 && i!=k-1; ){
			Pair temp=type[2].get(j);
			if(temp.cost>=min_cost[i]){
				item[i].add(temp.index);
				total_cost+=temp.cost;
				j--;
			}
			else
				i++;
		}

		for(; j>=i_2; j--){
			Pair temp=type[2].get(j);
			total_cost+=temp.cost;
			item[k-1].add(temp.index);
			if(min_cost[k-1]!=-1)
				min_cost[k-1]=Math.min(min_cost[k-1], temp.cost);
		}

		if(min_cost[k-1]!=-1)
			total_cost-=(double)min_cost[k-1]/2.0;


		if((long)total_cost==total_cost)
			out.append((long)total_cost+".0");
		else
			out.append((long)total_cost+".5");
		out.append("\n");

		for(i=0; i<k; i++){
			out.append(item[i].size()+" ");
			for(int value: item[i])
				out.append(value+" ");
			out.append("\n");
		}

		System.out.print(out);
	}
}