#include <cstdio>

 #include <cstring>

 #include <algorithm>

 using namespace std;

 struct Garment

 {

     int size;

     int model[];

 } garment[];

 bool dp[][];

 int main()

 {

 #ifdef LOCAL

     freopen("in", "r", stdin);

 #endif

     int T;

     scanf("%d", &T);

     while (T--)

     {

         int m, c;

         scanf("%d%d", &m, &c);

         for (int i = ; i <= c; i++)

         {

             scanf("%d", &garment[i].size);

             for (int j = ; j < garment[i].size; j++)

                 scanf("%d", &garment[i].model[j]);

             sort(garment[i].model, garment[i].model+garment[i].size);

         }

         int lowest = ;

         for (int i = ; i <= c; i++)

             lowest += garment[i].model[];

         if (lowest > m)

         {

             printf("no solution\n");

             continue;

         }

         memset(dp, , sizeof(dp));

         dp[][m] = ;

         for (int i = ; i <= c; i++)

         {

             for (int j = ; j <= m; j++)

                 if (dp[i-][j])

                 {

                     for (int p = ; p < garment[i].size; p++)

                         if (j - garment[i].model[p] >= )

                             dp[i][j-garment[i].model[p]] = ;

                 }

         }

         int p = ;

         while (!dp[c][p])  p++;

         printf("%d\n", m-p);

     }

     return ;

 }