#include<cstdio>
#include<cstring>
#include<algorithm>
#define inf 1000000000
using namespace std;
int cas,minpd,n,m;
][],path[][],answer[];
],b[];
int main()
{
  scanf("%d%d",&n,&m);
  ||m!=)
  {
      cas++;printf("Jury #%d\n",cas);
      ;i<=n;i++)scanf("%d%d",&a[i],&b[i]);
      memset(f,-,,sizeof(path));
      minpd=m*;
      f[][minpd]=;
      ;j<m;j++)
        ;k<=minpd*;k++)
          ;i<=n;i++)

            &&f[j][k]+a[i]+b[i]>f[j+][k+a[i]-b[i]])
            {
              int t1=j,t2=k;
              &&path[t1][t2]!=i)
              {
                t2-=a[path[t1][t2]]-b[path[t1][t2]];t1--;
              }
              )
              {
                f[j+][k+a[i]-b[i]]=f[j][k]+a[i]+b[i];
                path[j+][k+a[i]-b[i]]=i;
              }
            }
      ,k;
      &&f[m][i-j]<)j++;
      if(f[m][i+j]<f[m][i-j])k=i-j;else k=i+j;
      printf("Best jury has value %d for prosecution and value %d for defence:\n",
      (k-minpd+f[m][k])/,(f[m][k]-k+minpd)/);
      ;i<=m;i++)
      {
        answer[i]=path[m-i+][k];
        k-=a[answer[i]]-b[answer[i]];
      }
      sort(answer+,answer+m+);
      ;i<=m;i++)printf("%d ",answer[i]);
      printf("\n\n");
      scanf("%d%d",&n,&m);
   }
}