#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

int f(const VI& p)
{
	int cnt = 0;
	int n = SZ(p);
	VI used(n, 0);
	FOR (i, 0, n)
	{
		if (!used[i])
		{
			int x = p[i];
			used[i] = 1;
			while (p[x] != p[i])
			{
				used[x] = 1;
				cnt++;
				x = p[x];
			}
		}
	}
	return cnt;
}

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	int n, h, q;
	cin >> n >> h >> q;
	vector<set<PII>> s(n);
	FOR (i, 0, n)
	{
		s[i].insert({0, i});
		s[i].insert({h, i});
	}
	VI p(n);
	VI p2(n);
	iota(ALL(p), 0);
	iota(ALL(p2), 0);
	FOR (i, 0, q)
	{
		int y, x1, x2;
		cin >> y >> x1 >> x2;
		x1--, x2--;
		int idx1 = -1, idx2 = -1;
		FOR (j, 0, n)
		{
			auto it = prev(s[j].upper_bound(MP(y, -1)));
			if (it->S == x1)
				idx1 = j;
			if (it->S == x2)
				idx2 = j;
		}
		//cerr << i << ": " << idx1 << ' ' << idx2 << '\n';
		//FOR (k, 0, n)
		//	cerr << p[k] << ' ';
		//cerr << "\n";
		assert(idx1 != -1);
		assert(idx2 != -1);
		assert(idx1 != idx2);
		
		swap(p[p2[idx1]], p[p2[idx2]]);
		swap(p2[idx1], p2[idx2]);
		//FOR (k, 0, n)
		//	cerr << p[k] << ' ';
		//cerr << "\n\n";
		
		FOR (t, 0, 2)
		{
			auto it = s[idx1].lower_bound(MP(y, -1)); 
			if (it->F == y)
			{
				s[idx1].erase(it);
			}
			else
			{
				s[idx1].insert({y, x2});
			}
			swap(idx2, idx1);
			swap(x1, x2);
		}
		
		cout << f(p) << '\n';
	}
	
	return 0;
}