use std::collections::HashSet;
#[derive(Default)]
//NOTE
//declare variables to reduce the number of parameters for dp and dfs etc.
struct Solver {}

impl Solver {
    fn solve(&mut self) {
        let stdin = std::io::stdin();
        let mut scn = Scanner {
            stdin: stdin.lock(),
        };
        let h: usize = scn.read();
        let w: usize = scn.read();
        let m: usize = scn.read();
        let mut rows = vec![0; h];
        let mut cols = vec![0; w];
        let mut bombs = HashSet::new();
        let mut row_max = 0;
        let mut col_max = 0;
        (0..m).for_each(|_| {
            let h1: usize = scn.read();
            let w1: usize = scn.read();
            rows[h1 - 1] += 1;
            cols[w1 - 1] += 1;
            row_max = std::cmp::max(row_max, rows[h1 - 1]);
            col_max = std::cmp::max(col_max, cols[w1 - 1]);
            bombs.insert((h1 - 1, w1 - 1));
        });
        let mut row_maxs = vec![];
        let mut col_maxs = vec![];
        for (idx, cnt) in rows.iter().enumerate() {
            if *cnt == row_max {
                row_maxs.push(idx);
            }
        }
        for (idx, cnt) in cols.iter().enumerate() {
            if *cnt == col_max {
                col_maxs.push(idx);
            }
        }

        let result = row_max + col_max - 1;
        for &row in row_maxs.iter() {
            for &col in col_maxs.iter() {
                if !bombs.contains(&(row, col)) {
                    println!("{}", result + 1);
                    return;
                }
            }
        }
        println!("{}", result);
    }
}

fn main() {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024) // 64MB
        .spawn(|| {
            let mut solver = Solver::default();
            solver.solve()
        })
        .unwrap()
        .join()
        .unwrap();
}
pub mod utils {
    const DYX: [(isize, isize); 8] = [
        (0, 1),   //right
        (1, 0),   //down
        (0, -1),  //left
        (-1, 0),  //top
        (1, 1),   //down right
        (-1, 1),  //top right
        (1, -1),  //down left
        (-1, -1), //top left
    ];

    pub fn try_adj(y: usize, x: usize, dir: usize, h: usize, w: usize) -> Option<(usize, usize)> {
        let ny = y as isize + DYX[dir].0;
        let nx = x as isize + DYX[dir].1;
        if ny >= 0 && nx >= 0 {
            let ny = ny as usize;
            let nx = nx as usize;
            if ny < h && nx < w {
                Some((ny, nx))
            } else {
                None
            }
        } else {
            None
        }
    }
}

//snippet from kenkoooo
pub struct Scanner<R> {
    stdin: R,
}

impl<R: std::io::Read> Scanner<R> {
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn read_line(&mut self) -> String {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b'\n' || b == b'\r')
            .take_while(|&b| b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}


Measured memory_bytes: 16752