#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<iostream>
#include <math.h>
#define M 3000050 ///30*1000*100
using namespace std;

double Q;
int N;
int dp[M];
int W[50];
int k;
void input()
{
    int m;
    for(int i=1; i<=N; i++)
    {
        scanf("%d",&m);
        char c;
        double price;
        int sum = 0,sumA=0,sumB=0,sumC=0;
        int flag = 1;
        for(int j=1; j<=m; j++)
        {
            scanf(" %c:%lf",&c,&price);
            int v = (int)(price*100);
            //printf("%d %d %d %d\n",v,sumA,sumB,sumC);
            if(c==‘A‘&& sumA+v<=60000) {  ///单项和不能超过600
                sumA+=v;
            }
            else if(c==‘B‘&&sumB+v<=60000) {
                sumB+=v;
            }
            else if(c==‘C‘&&sumC+v<=60000) {
                sumC+=v;
            }else flag = 0;
        }
        if(flag&&sumA+sumB+sumC<=100000) {
               // printf("%d %d %d\n",sumA,sumB,sumC);
            W[k] = sumA+sumB+sumC;
            //printf("%d\n",W[k]);
            k++;
        }
    }
    k--;
    /*for(int i=1;i<=k;i++){
        printf("%d\n",W[i]);
    }*/
}
int main()
{

    while(scanf("%lf%d",&Q,&N)!=EOF,N)
    {
        k=1;
        int Q1 = (int)(Q*100);
        input();
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=k;i++){
            for(int v=Q1;v>=W[i];v--){
                dp[v] = max(dp[v],dp[v-W[i]]+W[i]);
            }
        }
        printf("%.2lf\n",dp[Q1]*1.0/100);
    }
    return 0;
}