#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
//#define mod 998244353ll
#define flagcount __builtin_popcount
#define flag(x) (1ll << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1ll << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))  //配列vでx未満の要素数を返す
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x))) //配列vでx以下の要素数を返す
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))         //配列vでx以上の要素数を返す
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))         //配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return -1;
}
template <typename T>
T lcm(T x, T y)
{
    T z = gcd(x, y);
    return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
    if (n < 2)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;
    double sqrtn = sqrt(n);
    for (T i = 3; i < sqrtn + 1; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
        i++;
    }
    return true;
}
template <typename T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b; // aをbで更新
        return true;
    }
    return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
    if (a > b)
    {
        a = b; // aをbで更新
        return true;
    }
    return false;
}
//場合によって使い分ける
//const ll dx[4]={1,0,-1,0};
//const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//2次元配列の宣言
//vector<vector<ll>> field(h, vector<ll>(w));

int main()
{
    cout << fixed << setprecision(30);
    ll H, W, M;
    cin >> H >> W >> M;
    vec h(M), w(M);
    loop(i, M) cin >> h[i] >> w[i];
    ll ans = 0;
    map<pair<ll, ll>, ll> count;
    map<ll, ll> countt;
    map<ll, ll> counttt;
    loop(i, M) countt[w[i]]++;
    loop(i, M) counttt[h[i]]++;
    ll maxxx = 0;
    loop(i, M) maxxx = max(maxxx, countt[w[i]]);
    ll maxxx2 = 0;
    loop(i, M) maxxx2 = max(maxxx2, counttt[h[i]]);
    vector<ll> maxx;
    vector<ll> maxx2;
    loop(i, M) if (countt[w[i]] == maxxx)
    {
        countt[w[i]] = 0;
        maxx.push_back(w[i]);
    }
    vector<bool> seen(H + 1, false);
    loop(i, M) if (counttt[h[i]] == maxxx2)
    {
        if (!seen[h[i]])
            maxx2.push_back(h[i]);
        seen[h[i]] = true;
    }
    ll siz = maxx.size();
    ll siz2 = maxx2.size();
    loop(i, M) count[make_pair(h[i], w[i])]++;
    //爆破位置のhを固定して、重なる分をカウント
    //重なるyを考えて、yの最大値をさらに加算
    //(h,y)となる分を除外
    ll counter = 0;
    loop(i, siz2)
    {
        ll hh = maxx2[i];
        ll preans = counttt[hh] + maxxx;
        ll minn = 1e9;
        loop(j, siz)
        {
            ll now = maxx[j];
            minn = min(minn, count[make_pair(hh, now)]);
            counter++;
            if (counter > 1e6)
                break;
        }
        if (counter > 1e6)
            break;
        preans -= minn;
        ans = max(ans, preans);
    }
    putout(ans);
    return 0;
}


Measured memory_bytes: 131308