#include <stdio.h>
#include <limits.h>
#include <stdlib.h>

int iq[3],bsol,n,m,time[3][10];
int troff[10][10][2],lt[10],temp[10];
int bass[3][10],lb[3],ass[3][10],l[3];
char used[10];

int comp(const int *a, const int *b) {
	return temp[*a]-temp[*b];
}

void backtrack(int,int);

void eval() {
	int sum = 0,i,j,ind[10],t[3][10];
	for (i=0; i<m; i++) {
		int sum2 = 0;
		for (j=0; j<l[i]; j++) {
			ind[j] = j;
			temp[j] = time[i][ass[i][j]];
		}
		qsort(ind,l[i],4,comp);
		for (j=0; j<l[i]; j++) {
			t[i][j] = ass[i][ind[j]];
			sum2 += time[i][t[i][j]];
			sum += sum2;
		}
	}
	if (sum<bsol) {
		bsol = sum;
		for (i=0; i<3; i++) {
			lb[i] = l[i];
			for (j=0; j<l[i]; j++)
				bass[i][j] = t[i][j];
		}
	}
}

void assign(int act) {
	int i;
	if (act == m-1) {
		l[act] = 0;
		for (i=0; i<n; i++)
			if (!used[i]) {
				if (time[act][i]<0)
					return;
				ass[act][l[act]++] = i;
			}
		eval();
		return;
	}
	l[act] = 0;
	backtrack(act,0);
}

void backtrack(int pers, int prob) {
	if (prob == n) {
		assign(pers+1);
		return;
	}
	if (!used[prob] && time[pers][prob]>=0) {
		ass[pers][l[pers]++] = prob;
		used[prob] = 1;
		backtrack(pers,prob+1);
		used[prob] = 0;
		l[pers]--;
	}
	backtrack(pers,prob+1);
}

int main() {
	int i,j,k,prob[10][3],tc=0;
	freopen("contest.in","r",stdin);
	while(scanf("%d %d",&m,&n)==2 && (n+m)) {
		printf("Case %d\n",++tc);
		for (i=0; i<m; i++)
			scanf("%d",&iq[i]);
		for (i=0; i<n; i++) {
			used[i] = 0;
			scanf("%d",&lt[i]);
			for (k=0; k<m; k++) time[k][i] = -1;
			for (j=0; j<lt[i]; j++) {
				scanf("%d %d",&troff[i][j][0],&troff[i][j][1]);
				for (k=0; k<m; k++)
					if (iq[k]>=troff[i][j][0])
						time[k][i] = troff[i][j][1];
			}
		}
		bsol = INT_MAX;
		assign(0);
		printf("Average solution time = %.2lf\n",(double)bsol/n);
		for (i=0; i<m; i++) {
			int sum = 0;
			for (j=0; j<lb[i]; j++) {
				prob[bass[i][j]][0] = i+1;
				prob[bass[i][j]][1] = sum;
				sum += time[i][bass[i][j]];
				prob[bass[i][j]][2] = sum;
			}
		}
		for (i=0; i<n; i++)
			printf("Problem %d is solved by member %d from %d to %d\n",i+1,prob[i][0],prob[i][1],prob[i][2]);
		printf("\n");
	}
	return 0;
}