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

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define spa << " " <<
#define fi first
#define se second
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long, long>;
using pdd = pair<ld, ld>;

template<typename T> struct V : vector<T> { using vector<T>::vector; };
V() -> V<ll>;
V(size_t) -> V<ll>;
template<typename T> V(size_t, T) -> V<T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<endl;}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<endl;};

const ll INF = (1ll<<62);
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;

int main(){

    ll H, W, M;
    cin >> H >> W >> M;

    V<ll> A(H, 0), B(W, 0);
    V<ll> h(M), w(M);
    set<pll> st;
    REP(i, M){
        cin >> h[i] >> w[i];
        h[i]--, w[i]--;
        A[h[i]]++;
        B[w[i]]++;
        st.insert({h[i], w[i]});
    }    

    V<ll> hdx(H), wdx(W);
    iota(ALL(hdx), 0);
    iota(ALL(wdx), 0);
    sort(ALL(hdx), [&](ll x, ll y){
        return A[x] > A[y];
    });
    sort(ALL(wdx), [&](ll x, ll y){
        return B[x] > B[y];
    });

    ll P=0, Q=0;
    REP(i, H){
        if(A[hdx[i]] == A[hdx[0]]) P++;
    }
    REP(i, W){
        if(B[wdx[i]] == B[wdx[0]]) Q++;
    }

    // dump(A)
    // dump(B)
    // dump(P)
    // dump(Q)

    ll cnt = 0;
    ll res = 0;
    REP(i, P){
        REP(j, Q){
            ll a = A[hdx[i]];
            ll b = B[wdx[j]];
            ll tmp = a + b;
            if(st.find({hdx[i], wdx[j]}) != st.end()) tmp--;
            chmax(res, tmp);
            cnt++;
            if(cnt>2*M){
                cout << res << endl;
                return 0;
            }
        }
    }

    cout << res << endl;

    return 0;
}

Measured memory_bytes: 35932