E

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;

int n, k;
const int maxn = 50000 + 5;
int s[maxn];
int fa[maxn];
int ans = 0;

void init(){
    ans = 0;
    for( int i = 0;i <= n;i++){
        fa[i] = i;
        s[i] = 0;   //关系
    }
}

int Find_fa(int x){
    if(x == fa[x])
        return x;
    else{
        int t = fa[x];
        fa[x] = Find_fa(t);
        s[x] = (s[x] + s[t])%3;
        return fa[x];
    }
}

bool is_yes(int x, int y){
    if(x < 1 || x > n || y < 1|| y > n)
        return true;
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    scanf("%d %d", &n, &k);
    int d, x, y;
    init();
    while(k--){
       scanf("%d  %d %d", &d, &x, &y);
        if(d == 2 && x == y){
            ans++;
            continue;
        }
        if(is_yes(x, y)){
            ans++;
            continue;
        }
        int vx = Find_fa(x);
        int vy = Find_fa(y);

        if ( vx == vy){
            if (d == 1 && s[x] != s[y]){
                ans++;
                continue;
            }
            else if (d == 2 && s[x] != (s[y] + 2)%3){
                ans++;
                continue;
            }
        }
        else{
            fa[vy] = vx;
            s[vy] = (s[x] + d - 1 + 3 - s[y])%3;
        }
    }
    printf("%d
", ans);
    return 0;
}