#include <iostream>

 #include <algorithm>

 #include <vector>

 using namespace std;

 const int MAX_N = ;

 int par[MAX_N];        //父节点

 int rankk[MAX_N];    //树的高度

 //初始化n个元素

 void init(int n)

 {

     for (int i = ; i < n; i++) {

         par[i] = i;

         rankk[i] = ;

     }

 }

 //查询树的根

 int find(int x) {

     if (par[x] == x) {

         return x;

     }

     else {

         return par[x] = find(par[x]);

     }

 }

 //合并x和y所属于的集合

 void unite(int x, int y) {

     x = find(x);

     y = find(y);

     if (x == y) return;

     if (rankk[x] < rankk[y]) {

         par[x] = y;

     }

     else {

         par[y] = x;

         if (rankk[x] == rankk[y]) rankk[x]++;

     }

 }

 //判断x和y是否属于同一个集合

 bool same(int x, int y) {

     return find(x) == find(y);

 }

 //=============================================================

 int N, K;

 int T[MAX_N], X[MAX_N], Y[MAX_N];

 void solve()

 {

     //初始化并查集

     //元素x ,x+N,x+2*N分别代表x-A x-B x-C

     init(N * );

     int ans = ;

     for (int i = ; i < K; i++) {

         int t = T[i];

         int x = X[i] - , y = Y[i] - ;

         //不正确的编号

         if (x <  || N <= x || y <  || N <= y) {

             ans++;

             continue;

         }

         if (t == ) {

             //xy属于同一类

             if (same(x, y + N) || same(x, y +  * N)) {

                 ans++;

             }

             else {

                 unite(x, y);

                 unite(x + N, y + N);

                 unite(x +  * N, y +  * N);

             }

         }

         else {

             //x吃y

             if (same(x, y) || same(x, y +  * N)) {

                 ans++;

             }

             else {

                 unite(x, y + N);

                 unite(x + N, y +  * N);

                 unite(x +  * N, y);

             }

         }

     }

     printf("%d\n", ans);

 }

 int main()

 {

     cin >> N >> K;

     for (int i = ; i < K; i++) {

         cin >> T[i] >> X[i] >> Y[i];

     }

     solve();

     return ;

 }