#include <bits/stdc++.h>
typedef long long ll;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
ll l, r;
std::cin >> l >> r;
std::vector<bool> good(r);
ll good_sum = 0;
std::priority_queue<std::pair<ll, ll>, std::vector<std::pair<ll, ll>>,
std::greater<>>
pq;
std::vector<ll> left(r), sum(r);
std::vector<std::deque<ll>> rows(r);
for (ll cnt = 0; cnt < r; ++cnt) {
auto &v = rows[cnt];
ll len;
std::cin >> len;
v.resize(len);
for (auto &i : v) {
std::cin >> i;
}
sum[cnt] = std::accumulate(v.begin(), v.end(), 0LL);
pq.push({left[cnt] + v[0], cnt});
v.pop_front();
if (1 < l - (sum[cnt] - left[cnt]) + 1) {
good[cnt] = true;
good_sum++;
} else {
good[cnt] = false;
}
}
ll ans = 0;
for (ll _i = 1; _i <= l; ++_i) {
while (!pq.empty() and pq.top().first < _i) {
auto [l, i] = pq.top();
pq.pop();
left[i] = l;
// x blocks from right ==> l - x + 1 from left
good_sum -= good[i];
if (_i < l - (sum[i] - left[i]) + 1) {
good[i] = true;
good_sum++;
} else {
good[i] = false;
}
if (!rows[i].empty()) {
pq.push({left[i] + rows[i][0], i});
rows[i].pop_front();
}
}
ll gs = 0;
for (ll j = 0; j < r; ++j) {
gs += _i < l - (sum[j] - left[j]) + 1;
}
ans += gs != r;
}
std::cout << ans << '\n';
}
