#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:512000000")
#include<utility>
#include<iostream>
#include<fstream>
#include<vector>
#include<array>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<functional>
#include<random>
#include<climits>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<cassert>
#include<ccomplex>
#include<chrono>

#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("unroll-loops")
#define int128 __int128
#else
#define int128 long long
#endif

#define all(x) x.begin(), x.end()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
#define mp make_pair
#define X first
#define Y second

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
mt19937_64 gen(time(nullptr));

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

ll mod = 1e9 + 7;

namespace {
    ll mul(ll a, ll b) {
        ll val = a * b - (ll)((ld)a * b / mod) * mod;
        if (val < 0) val += mod;
        if (val >= mod) val -= mod;
        return val;
    }
    ll poww(ll a, ll b) {
        ll val = 1;
        a %= mod;
        while (b > 0) {
            if (b % 2) val = mul(a, val);
            a = mul(a, a);
            b >>= 1;
        }
        return val % mod;
    }
    ll inv(ll a) {
        return poww(a, mod - 2);
    }
}

ll const maxn = 3e5 + 5;
ll cntx[maxn], cnty[maxn];
vector<ll> gx[maxn], gy[maxn];

signed main() {
    ios_base::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    ll n, m, k;  cin >> n >> m >> k; 
    for (ll i = 0; i < k; i++) {
        ll x, y; cin >> x >> y; x--; y--;
        cntx[x] ++;
        cnty[y] ++;
        gx[x].push_back(y);
        gy[y].push_back(x);
    }
    vector<ll> kekx, keky;
    for (ll i = 0; i < n; i++) {
        kekx.push_back(i);
    }
    for (ll i = 0; i < m; i++) {
        keky.push_back(i);
    }
    sort(all(kekx), [&](ll i, ll j) {
        return cntx[i] > cntx[j];
    });

    sort(all(keky), [&](ll i, ll j) {
        return cnty[i] > cnty[j];
    });


    ll ans = cntx[kekx[0]] + cnty[keky[0]] - 1;

    ll lolx = 0, loly = 0;
    for (ll i = 0; i < n; i++) {
        if (cntx[kekx[i]] == cntx[kekx[0]]) lolx++;
    }

    for (ll i = 0; i < m; i++) {
        if (cnty[keky[i]] == cnty[keky[0]]) loly++;
    }

    bool f = false;
    for (ll i = 0; i < n; i++) {
        if (cntx[i] == cntx[kekx[0]]) {
            ll cnt = 0;
            for (ll y : gx[i]) {
                if (cnty[y] == cnty[keky[0]]) cnt++;
            }
            assert(cnt <= loly);
            if (cnt < loly) f = true;
        }
    }
    
    cout << ans + f << endl;

    return 0;
}

/*


*/

/*

*/

Measured memory_bytes: 49116