#include<bits/stdc++.h> using namespace std; const int maxn = 8e3 + 5; const int maxm = 4400 + 5; struct node{ int l, r; }; int n, m, k, u, v, cnt_; int connect[maxn], cnt[maxn]; node lnk[maxm]; bool cmp(node a, node b){ if(cnt[a.l] == cnt[b.l]){ return cnt[a.r] < cnt[b.r]; } return cnt[a.l] < cnt[b.l]; } int main(){ cin >> n >> m; for(int i = 1; i <= m; i++){ cin >> k; cin >> lnk[i].l >> lnk[i].r; cnt[lnk[i].l]++; cnt[lnk[i].r]++; } sort(lnk + 1, lnk + m + 1, cmp); for(int i = 1; i <= m; i++){ u = lnk[i].l, v = lnk[i].r; connect[u]++; connect[v]++; if(connect[u] == 2 || connect[v] == 2){ cnt_--; connect[u]--; connect[v]--; } } cout << m + cnt_ << endl; return 0; }