#include<bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long

#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
// #define MOD 1000000007
#define MOD 998244353 
#define MEM_SIZE 101010
#define DEBUG_OUT true

#define ALL(x) (x).begin(), (x).end()


template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; abort();}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }


template< typename T >
struct edge {
  int src, to;
  T cost;
 
  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
 
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
 
  edge &operator=(const int &x) {
    to = x;
    return *this;
  }
 
  operator int() const { return to; }
};
 
template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;
 
 
vector<int> dijkstra(WeightedGraph<int> &G,int s)
{ 
  
  vector<int> path(G.size(),I64_MAX);
  path[s] = 0;
  priority_queue <pair<int,int> ,vector<pair<int,int> > ,greater<pair<int,int> > > que;
 
  que.emplace(path[s],s);
 
  while(!que.empty())
  {
    int cost;
    int idx;
    tie(cost,idx) = que.top();
    que.pop();
 
    if(path[idx] < cost) continue;
    for (auto &e: G[idx])
    {
      int next_cost = cost + e.cost;
      if(path[e.to] <= next_cost) continue;
      path[e.to] = next_cost;
      que.emplace(path[e.to],e.to);
    }
  }
 
  return path;
}
 
//SOLVE
void solve(void)
{
  int h,w,m;
  cin>>h>>w>>m;;
  vector<int> vec (h+1,0);
  vector<int> vecc(w+1,0);
  vector<pair<int,int > > vp;
  for (int i = 0; i < m; i++)
  {
    int x,y;
    cin>>x>>y;
    vec[x]++;
    vecc[y]++;
    vp.emplace_back(x,y);
  }
  int index1 = -1;
  int mm = -1;
  for (int i = 0; i < h+1; i++)
  {
    if(chmax(mm,vec[i]))
    {
      index1 = i;
    }
  }
  int v = index1;
  vector<int> vec2(w+1,0);
  for (int i = 0; i < m; i++)
  {
    if(vp[i].first == v)continue;
    vec2[vp[i].second] += 1;
  }
  int index2 = -1;
  mm = -1;
  for (int i = 0; i < w+1; i++)
  {
    if(chmax(mm,vec2[i]))
    {
      index2 = i;
    }
  }
  int res = 0;
  // DEBUG(vec,vec2);
  // DEBUG(index1,index2);
  for (auto &&i : vp)
  {
    if(i.first != index1 and i.second != index2)res++;
  }
  int fres = -1;
  chmax(fres,m-res);

  
  index1 = -1;
  mm = -1;
  for (int i = 0; i < w+1; i++)
  {
    if(chmax(mm,vecc[i]))
    {
      index1 = i;
    }
  }
  v = index1;
  vector<int> vec4(h+1,0);
  for (int i = 0; i < m; i++)
  {
    if(vp[i].second == v)continue;
    vec4[vp[i].first] += 1;
  }
  index2 = -1;
  mm = -1;
  for (int i = 0; i < h+1; i++)
  {
    if(chmax(mm,vec4[i]))
    {
      index2 = i;
    }
  }
  res = 0;
  // DEBUG(vec,vec2);
  // DEBUG(index1,index2);
  for (auto &&i : vp)
  {
    if(i.first != index2 and i.second != index1)res++;
  }
  // DEBUG(res);
  chmax(fres,m - res);
  cout<<fres<<endl;


}

int32_t main(int32_t argc, const char *argv[])
{
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  std::cout << std::fixed;
  std::cout << std::setprecision(11);
  solve();

  return 0;
}


Measured memory_bytes: 17244