#include <stdio.h>  
#include <string.h>  
#include <algorithm>  
using namespace std;
int main()
{
    int t, p[105], w[105], c[105], dp[105];
    scanf("%d", &t);
    while (t--)
    {
        int n, m, count = 0;
        scanf("%d %d", &n, &m);
        for (int i = 0; i<m; i++)
            scanf("%d %d %d", &p[i], &w[i], &c[i]);
        memset(dp, 0, sizeof(dp));
        int temp = 0;
        for (int i = 0; i<m; i++)
        {
            for (int j = n; j >= p[i]; j--)  
            {
                for (int k = 1; k <= c[i]; k++)      //枚举每个种类大米的个数
                {
                    if (j<k*p[i]) break;
                    dp[j] = max(dp[j - k * p[i]] + k * w[i], dp[j]);
                }
            }
        }
        printf("%d\n", dp[n]);
    }
    return 0;
}