#include<iostream>#include<cstdio>#include<queue>#include<cstring>using namespace std;double total;int n; int dp[3000050];int main(){    while(~scanf("%lf%d,&total",&total,&n) && n)    {        memset(dp,0,sizeof(dp));        int counts = 0,ans[35] = {0};        while(n--)        {            int num,flag = 1;            double all[3] = {0};            scanf("%d",&num);            while(num--)            {                getchar();                char c;                double temp;                scanf(" %c:%lf",&c,&temp);                if(c != ‘A‘ && c != ‘B‘ && c != ‘C‘)                {                    flag = 0;                    break;                }                    all[c-‘A‘] += temp;            }            if(flag && all[0] < 600+1e-6 && all[1] < 600+1e-6 && all[2] < 600+1e-6)            {                ans[counts++] = (int)(100*all[0]+100*all[1]+100*all[2]);            }        }        for(int i = 0;i < counts;i++)        {            for(int j = (int)(total*100);j >= ans[i];j--)            {                dp[j] = max(dp[j],dp[j-ans[i]]+ans[i]);            }        }        printf("%.2f\n",(double)dp[(int)(total*100)]/100);    }     return 0;}