codeforces 754D Fedor and coupons （优先队列）

All our characters have hobbies. The same is true for Fedor. He enjoys shopping in the neighboring supermarket.

The goods in the supermarket have unique integer ids. Also, for every integer there is a product with id equal to this integer. Fedor has n discount coupons, the i-th of them can be used with products with ids ranging from l_i to r_i, inclusive. Today Fedor wants to take exactly k coupons with him.

Fedor wants to choose the k coupons in such a way that the number of such products xthat all coupons can be used with this product x is as large as possible (for better understanding, see examples). Fedor wants to save his time as well, so he asks you to choose coupons for him. Help Fedor!

Input

The first line contains two integers n and k (1 ≤ k ≤ n ≤ 3·10⁵) — the number of coupons Fedor has, and the number of coupons he wants to choose.

Each of the next n lines contains two integers l_i and r_i ( - 10⁹ ≤ l_i ≤ r_i ≤ 10⁹) — the description of the i-th coupon. The coupons can be equal.

Output

In the first line print single integer — the maximum number of products with which all the chosen coupons can be used. The products with which at least one coupon cannot be used shouldn't be counted.

In the second line print k distinct integers p₁, p₂, ..., p_k (1 ≤ p_i ≤ n) — the ids of the coupons which Fedor should choose.

If there are multiple answers, print any of them.

Example

Input

4 2
1 100
40 70
120 130
125 180

Output

31
1 2 

Input

3 2
1 12
15 20
25 30

Output

0
1 2 

Input

5 2
1 10
5 15
14 50
30 70
99 100

Output

21
3 4 

Note

In the first example if we take the first two coupons then all the products with ids in range [40, 70] can be bought with both coupons. There are 31 products in total.

In the second example, no product can be bought with two coupons, that is why the answer is 0. Fedor can choose any two coupons in this example.

题目大意：这题的题目意思就是给你n个区间，然后让你从中间选k个区间，让这k个区间的交集最长，然后输出长度和这几个区间的序号，也就是第几个区间。

题目分析：这题由于数据范围较大，所以采用优先队列的方法，首先按照左区间对区间进行从小到大排序，然后把右区间依次压入队列中，队列中也是从小到大排序，小的在顶端。所以用top减去当前遍历的左区间值，得到之后加1和ans做比较，得到最大值即可。

ps ：那个greater是按从小到大的顺序排序

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int maxn = 3e5+10;
struct node {
	int r,l,id;
}a[maxn];
int cmp(node x,node y){
	return x.l < y.l;
}
int main(){
	int n,m,k;
	scanf("%d%d",&n,&k);
	for(int i=0;i<n;i++){
		scanf("%d%d", &a[i].l,&a[i].r);
		a[i].id = i+1;
	}
	int ans=0,L=0;
	priority_queue<int ,vector<int>,greater<int > >q;
	sort(a,a+n,cmp);
	for(int i=0;i<n;i++){
	      q.push(a[i].r);
		  if(q.size() >k)
		    q.pop() ;
		int  len = q.top() - a[i].l +1;
		if(len > ans && q.size() == k ){
			ans = len;
			L =  a[i].l ;
		} 
	}
	printf("%d\n",ans);
	if(ans == 0){
		printf("1");
		for(int i=2;i<=k;i++)
		 printf(" %d",i);
	}
	else {
		for(int i=0;i<n&&k;i++){
			if(L>=a[i].l&&L+ans-1<=a[i].r){
				if(k>=1)
				  printf("%d ",a[i].id);
				else 
				  printf("%d",a[i].id);
 				k--;
			}
		}
	}
	printf("\n");
}