#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

int p = 0, n = 0, likutis = 0, kiek = 0;
struct lentyna
{
	int count;
	int preke[100];
	int did;
};
lentyna m[100];


void Skaitymas(int& p, int& n, lentyna m[]);
void Skaicaivimas(int p, int n, lentyna m[], int likutis, int kiek);

int main()
{
	Skaitymas(p, n, m);
	Skaicaivimas(p, n, m, likutis, kiek);
}

void Skaitymas(int& p, int& n, lentyna m[])
{
	ifstream d("duom.txt");
	d >> p >> n;
	for (int i = 0; i < n; i++)
	{
		d >> m[i].count;
		for (int j = 0; j < m[i].count; j++)
		{
			d >> m[i].preke[j];
		}
	}

	d.close();
}

void Skaicaivimas(int p, int n, lentyna m[], int likutis, int kiek)
{
	likutis = p;
	int c = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m[i].count; j++)
		{
			if (m[i].preke[j] > m[i].did && m[i].preke[j] <= p)
			{
				m[i].did = m[i].preke[j];
			}
		}
	}

	for (int i = 0; i < n; i++)
	{
		if (likutis - m[i].did > 0)
		{
			likutis -= m[i].did;
			c++;
		}
	}


}