#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;


mt19937 rng;

struct Node
{
	int l, r;	
	int x;	
	int y;	
	int val;
	
	void init(int h, int rod)
	{
		l = r = -1;
		x = h;
		y = rng();
		val = rod;
	}
};

const int N = 400'447;

struct Treap
{
	Node A[N];
	int sz = 0;
	
	
	int newNode(int h, int r)
	{
		A[sz].init(h, r);
		return sz++;
	}
	
	PII split(int v, int h)
	{
		if (v == -1) 
			return {-1, -1};
		PII res;
		if (h < A[v].x)
		{
			res = split(A[v].l, h);
			A[v].l = res.second;
			res.second = v;
		}
		else
		{
			// split(v, val)
			res = split(A[v].r, h);
			A[v].r = res.first;
			res.first = v;
		}
		return res;
	}
	int merge(int v, int u)
	{
		if (v == -1) return u;
		if (u == -1) return v;
		int res;
		if (A[v].y > A[u].y)
		{
			res = merge(A[v].r, u);
			A[v].r = res;
			res = v;
		}
		else
		{
			res = merge(v, A[u].l);
			A[u].l = res;
			res = u;
		}
		return res;
	}
	int getVal(int v, int h)
	{
		if (v == -1) 
			return -1;
		if (A[v].x == h)
			return A[v].val;
		if (A[v].x > h)
			return getVal(A[v].l, h);
		else
			return getVal(A[v].r, h);
	}
	int lower_bound(int v, int h)
	{
		if (v == -1)
			return -1;
		if (A[v].x > h)
			return lower_bound(A[v].l, h);
		else
		{
			int x = lower_bound(A[v].r, h);
			if (x == -1)
				x = A[v].val;
			return x;
		}
	}
	int insert(int v, int h, int r)
	{
		if (getVal(v, h) == -1)
		{
			PII p = split(v, h);
			v = merge(p.F, newNode(h, r));
			v = merge(v, p.S);
			return v;
		}
		else
		{
			PII p = split(v, h - 1);
			PII p2 = split(p.S, h);
			return merge(p.F, p2.S);
		}
	}
	
	void print(int v)
	{
		if (v == -1)
			return;
		print(A[v].l);
		cerr << A[v].x << ' ' << A[v].val << '\n';
		print(A[v].r);
	}
} T;



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<int> s(n, -1);
	FOR (i, 0, n)
	{
		s[i] = T.insert(s[i], 0, i);
		s[i] = T.insert(s[i], h + 47, i);
	}
	VI p(n);
	VI p0(n);
	iota(ALL(p), 0);
	iota(ALL(p0), 0);
	FOR (i, 0, q)
	{
		int y, x1, x2;
		cin >> y >> x1 >> x2;
		x1--, x2--;
		int idx1 = -1, idx2 = -1;
		FOR (j, 0, n)
		{
			int val = T.lower_bound(s[j], y);
			if (val == x1)
				idx1 = j;
			if (val == 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[p0[idx1]], p[p0[idx2]]);
		swap(p0[idx1], p0[idx2]);
		//FOR (k, 0, n)
		//	cerr << p[k] << ' ';
		//cerr << "\n";
		//
		//cerr << idx1 << ' ' << idx2 << '\n';
		//cerr << '\n';
		s[idx1] = T.insert(s[idx1], y, x2);
		s[idx2] = T.insert(s[idx2], y, x1);
		
		PII p1 = T.split(s[idx1], y);
		PII p2 = T.split(s[idx2], y);
		
		//cerr << "SPLIT\n";
		//T.print(p1.F);
		//cerr << '\n';
		//T.print(p1.S);
		//cerr << '\n';
		//T.print(p2.F);
		//cerr << '\n';
		//T.print(p2.S);
		//cerr << '\n';
		
		s[idx1] = T.merge(p1.F, p2.S);
		s[idx2] = T.merge(p2.F, p1.S);
		//cerr << s[idx1] << ' ' << p0[idx1] << '\n';
		//cerr << s[idx2] << ' ' << p0[idx2] << '\n';
		//
		//cerr << "DUPA\n";
		//FOR (j, 0, n)
		//{
		//	cerr << j << ' ' << s[j] << ":\n";
		//	T.print(s[j]);
		//}
		//cerr << "\n\n";
		cout << f(p) << '\n';
	}
	
	return 0;
}