#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m, k;
	cin >> n >> m >> k;
	vector<pair<int, int>> pont;
	for (int i = 0; i < k; i++) {
		int a, b;
		cin >> a >> b;
		pont.push_back(make_pair(a, b));
	}
	sort(pont.begin(), pont.end());
	vector<int> ordinata;
	for (int i = 0; i < k; i++) {
		ordinata.push_back(pont[i].second);
	}
	vector<int> mo;
	for (int i = 0; i < k; i++) {
		auto it = lower_bound(mo.begin(), mo.end(), -ordinata[i]);
		if (it == mo.end()) {
			mo.push_back(-ordinata[i]);
		} else {
			*it = -ordinata[i];
		}
	}
	cout << mo.size();
}