#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define rrepSE(i,s,e) for (int i = (s); i > (e); i--)
#define ssort(v) sort(v.begin(), v.end())
#define gsort(v) sort(v.rbegin(), v.rend())
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
#define DEBUG_PRINT(var) std::cout << #var << " = " << var << "\n";

int main()
{
    int h, w, m;
    cin >> h >> w >> m;
    vector<pint> mxh, mxw;
    rep(i,h) mxh.emplace_back(0,i);
    rep(i,w) mxw.emplace_back(0,i);
    map<pint, int> mp;
    rep(i,m) {
        int hi, wi;
        cin >> hi >> wi;
        hi --; wi --;
        mp[pint(hi,wi)]++;
        mxh[hi].first++;
        mxw[wi].first++;
    }
    gsort(mxh);
    gsort(mxw);
    int ans = mxh[0].first + mxw[0].first - 1;
    bool end_flag = false;
    rep(i,h) {
        if (mxh[i].first != mxh[0].first) break;
        rep(j,w) {
            if (mxw[j].first != mxw[0].first) break;
            int hi = mxh[i].second;
            int wi = mxw[j].second;
            if (mp[pint(hi,wi)] > 0) {
                ans = mxh[i].first + mxw[j].first  - 1;
            }
            else {
                ans = mxh[i].first + mxw[j].first;
                end_flag = true;
                break;
            }
        }
        if (end_flag) break;
    }

    cout << ans << "\n";
    return 0;
}


Measured memory_bytes: 26648