Problem: 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 li to ri, 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 x that 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·105) — the number of coupons Fedor has, and the number of coupons he wants to choose.

Each of the next n lines contains two integers li and ri ( - 109 ≤ li ≤ ri ≤ 109) — 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 p1, p2, ..., pk (1 ≤ pi ≤ n) — the ids of the coupons which Fedor should choose.

If there are multiple answers, print any of them.

Examples

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.

Solution (in JAVA):

Solution:

/*
    About the solution, Note that if there is any answer exists with size X, 
                        There is also such an answer that it's right bound is 
                        on the one of the end boundaries of one of the coupons.
        
                ( Suppose input boundaries are [Li..Ri] )
        Proof : Suppose you have found an answer with size X that lies on [P..Q] and Q is not 
                on the one of the end boundaries(Ri's) of some of the coupons.
                You can always move [P..Q] forward untill Q become equal to one of the Ri's.
*/

var z;
var n , k;
var a = [];
var p = [];

function readArray()
{
    return readline().split( ' ' ).map( Number );
}

function check( sz , which )
{
    // special case
    if ( sz == 0 ) return { ok : true , left : 0 , right : 0 , whichOnes : undefined };
    
    // status of each boundary : 0=not seen , 1=compeletely in the current boundary , 2=out of ...
    var f = new Array( n );
    for ( var i=0 ; i<n ; i++ ) f[i] = 0;
    
    var j=0 , i=0;          // i is moving forward and j is keeping distance sz from it
    var cnt = 0 , ret = 0;
    var found = false;
    var end = -8e9;
    var whichOnes = [];
    
    while ( i<2*n )
    {
        // find a closing bracket ... just closing brackets matter for i
        while ( p[i].type == +1 ) i++;
        
        // j keeps distance SZ from i
        while ( (j<2*n) && (p[i].pos - p[j].pos + 1) >= sz )
        {
            var id = p[j].id;
            if ( p[j].type == +1 )
            {
                if ( f[id] == 0 ) f[id] = 1 , cnt++;
            }
            j++;
        }
        
        // update the answer
        if ( cnt > ret )
        {
            ret = cnt;
            if ( ret >= k && found == false )
            {
                if ( which )
                {
                    var c = 0;
                    for ( var l=0 ; l<n && c<k ; l++ )
                        if ( f[l] == 1 )
                        {
                            c++;
                            whichOnes.push( l+1 );
                        }
                }   
                
                found = true;
            }
        }
        
        var id = p[i].id;
        if ( f[id] == 0 ) f[id] = 2;
        else if ( f[id] == 1 ) f[id] = 2 , cnt--;
        i++;
    }
    
    return { ok : found , right : end , left : end - sz + 1 , whichOnes : whichOnes };
}

function main()
{
    // get input and prepare it for solving the problem
    z = readArray();
    n = z[0] , k = z[1];
    for ( var i=0 ; i<n ; i++ ) a[i] = readArray();
    
    for ( var i=0 ; i<n ; i++ )
    {
        p.push( { pos:a[i][0] , type:+1 , id:i } );
        p.push( { pos:a[i][1] , type:-1 , id:i } );
    }
    p.sort( function( fi , se ) {
        if ( fi.pos != se.pos ) return fi.pos - se.pos;
        if ( fi.type != se.type ) return fi.type==+1 ? -1 : +1;
        return fi.id - se.id;
    } );
    
    
    // Binary Search on the size
    var l = 0 , r = 2e9 + 5;
    while ( l < r )
    {
        var mid = Math.floor( ( l + r ) / 2 );
        if ( check( mid , false ).ok == true ) l = mid+1;
        else r = mid;
    }
    
    
    // Prepare answer for output
    var ans = check( r-1 , true );
    if ( ans.whichOnes == undefined )
    {
        ans.whichOnes = []
        for ( var i=0 ; i<k ; i++ )
            ans.whichOnes.push( i+1 );
    }
    
    print( r-1 );
    // print( ans.left + " " + ans.right );
    ans.whichOnes.forEach( function(x) { write( x + " " ); } );
    print();
    
} main();