#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
ll l, r;
cin >> l >> r;
vector<vector<ll>> a(r);
for (int i = 0; i < r; i++) {
ll x;
cin >> x;
for (int j = 0; j < x; j++) {
ll u;
cin >> u;
if (j == 0)
a[i].push_back(u);
else {
a[i].push_back(u + a[i][j - 1]);
}
}
}
ll count = 0;
for (int i = 0; i < l; i++) {
ll countif = 0;
for (int row = 0; row < r; row++) {
ll left = 0;
ll right = 0;
ll idx = upper_bound(a[row].begin(), a[row].end(), i) - a[row].begin();
if (idx == 0)
left = 0;
else
left = a[row][idx - 1];
right = a[row].back() - left;
if (right <= l - i - 1) {
countif++;
}
}
if (countif != r) {
count++;
}
}
cout << count << "\n";
}
