/*
 * @(#) msu98_c.c - Problem 'C' ("Parliament") solution
 * of the ACM Programming Contest at the MSU in 1998.
 * (c) 1998 Ivan Maidanski <ivmai@chat.ru> http://ivmai.chat.ru
 * Freeware program source. All rights reserved.
 **
 * Language: ANSI C
 * Tested with: Borland C++ v3.1
 * Last modified: 1998-10-07 20:45:00 GMT+04:00
 */

/* Input data file: c.dat */

#include <stdlib.h> /* malloc(), free() */
#include <stdio.h> /* FILE, fopen(), fscanf(), printf() */

#define N 1000

int k[N];
float p[N];
float *q,*r;

int main()
{
 FILE *f=fopen("c.dat","rt");
 int t,curt;
 int x,m,n;
 float p0,s;
 int i,j;
 fscanf(f,"%*[^-0-9]%d",&t);
 for (curt=1;curt<=t;curt++)
 {
  fscanf(f,"%*[^-0-9]%d%*[^-0-9]%d%*[^-0-9]%d",&x,&m,&n);
  for (i=0,s=0;i<n;i++)
  {
   fscanf(f,"%*[^-.0-9]%f%*[^-.0-9]%f%*[^-0-9]%d",&p0,p+i,k+i);
   p[i]-=p0;
   s+=p0;
  }
  printf("***** %d\n",curt);
  if ((x-=m)>=0)
  {
   q=(float *)malloc((x+1)*sizeof(float));
   r=(float *)malloc((x+1)*sizeof(float));
   for (j=0;j<=x;j++)
    q[j]=s;
   for (i=0;i<n;i++)
   {
    for (j=0;j<=x;j++)
     r[j]=(j>=k[i] && q[j-k[i]]+p[i]>q[j])? q[j-k[i]]+p[i] : q[j];
    for (j=0;j<=x;j++)
     q[j]=r[j];
   }
   free((void *)r);
   for (j=0;j<x && q[j]<0.7*n;j++);
   x+=m-j;
   if (m<x/10)
    m=x/10;
   printf("Expected percentage of agreed: %1.0f%%\n"
          "Spent on parliament: %d\n"
          "Spent on expert group: %d\n"
          "President's income: %d\n",
          100*q[j]/n,j,m,x-m);
   free((void *)q);
  }
   else printf("Expert group refuses to work.\n");
 }
 return 0;
}