#include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second

using namespace std;
typedef pair<int, int> PII;
typedef long long ll;

struct DSU {
	vector<int> rt;
	DSU() {}
	DSU(int n) { prework(n); }
	void prework(int n) {
		rt.resize(n + 1);
		iota(rt.begin(), rt.end(), 0);
	}
	int root(int x) {
		if (rt[x] != x) rt[x] = root(rt[x]);
		return rt[x];
	}
	bool merge(int x, int y) {
		int rx = root(x), ry = root(y);
		if (rx != ry) {
			rt[rx] = ry;
			return 1;
		}
		return 0;
	}
	bool same(int x, int y) {
		return root(x) == root(y);
	}
};

signed main() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    
    // A: 1 ~ n; B: n+1 ~ 2n; C: 2n+1 ~ 3n
    int n, m;
    cin >> n >> m;
    
    DSU dsu(3 * n);
    int res = 0;
    while (m -- ) {
    	int op, x, y;
    	cin >> op >> x >> y;
    	
    	if (op == 2 && x == y || x > n || y > n) res ++;
    	else if (op == 1) {
    		if (dsu.same(x, y + n) || dsu.same(x, y + 2 * n)) {
    			res ++;
    			continue;
			}
    		for (int i = 0; i < 3; i ++) dsu.merge(x + i * n, y + i * n);
		} else {
			if (dsu.same(x, y) || dsu.same(x, y + 2 * n)) {
				res ++;
				continue;
			}
			for (int i = 0; i < 3; i ++) dsu.merge(x + i * n, y + (i + 1) % 3 * n);
		}
	}

	cout << res << endl;

	return 0;
}