#include<bits/stdc++.h>
const int N=1000005;
using namespace std;
template<class T>
inline void read(T &x)
{
x=0;
static char ch=getchar();
while(!isdigit(ch)) ch=getchar();
while(isdigit(ch)) x=x*10+ch-'0',ch=getchar();
}
inline void write(int x)
{
if(x<0)
{
x=-x;
putchar('-');
}
if(x>9) write(x/10);
putchar(x%10+'0');
}
int n,k,ans;
struct Data
{
int l,r,pos;
bool operator < (const Data &x) const
{
return this->r>x.r;
}
}a[N];
priority_queue <Data> q;
inline bool cmp(const Data &x,const Data &y) {return x.l<y.l;}
int main()
{
read(n),read(k);
for(int i=1;i<=n;i++) read(a[i].l),read(a[i].r),a[i].pos=i;
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++)
{
q.push(a[i]);
if(i>=k) ans=max(ans,q.top().r-a[i].l),q.pop();
}
write(ans); putchar(' ');
while(!q.empty()) q.pop();
for(int i=1;i<=n;i++)
{
q.push(a[i]);
if(i>=k)
{
if(q.top().r-a[i].l==ans)
{
for(int j=1;j<=k;j++)
{
write(q.top().pos),putchar(' ');
q.pop();
}
return 0;
}
q.pop();
}
}
return 0;
}