#include <stdio.h>//#include <string.h>#define N 101

int f[N][N];struct _rice{int p, h, c;}rice[N];

int MAX(int a, int b){return a > b ? a : b;}

int main(){int t, n, m, max;int i, j, k;    scanf("%d", &t);while(t --)    {        scanf("%d%d", &n, &m);for(i=1;i<=m;i++)        {            scanf("%d%d%d", &rice[i].p, &rice[i].h, &rice[i].c);        }//memset(rice, 0, sizeof(rice));        for(i=1;i<=m;i++)        {            f[i][0] = 0;for(j=0;j<=n;j++)            {                f[0][i] = 0;                max = 0;for(k=0;k<=rice[i].c;k++)                {if(j < k*rice[i].p)                    {break;                    }else                    {                        max = MAX(max, f[i-1][j-k*rice[i].p] + k*rice[i].h);                    }                    f[i][j] = MAX(max, f[i-1][j]);                }/*可以将第一项拿出来减少循环次数*//*    if(j < rice[i].p)                {                    f[i][j] = f[i-1][j];                }                else                {                    max = 0;                    for(k=1;k<=rice[i].c;k++)                    {                        if(j < k*rice[i].p)                        {                            break;                        }                        else                        {                            max = MAX(max, f[i-1][j-k*rice[i].p] + k*rice[i].h);                        }                    }                    f[i][j] = MAX(max, f[i-1][j]);                }*/            }        }        printf("%d\n", f[m][n]);    }return 0;}