output_description: Print an integer representing the minimum number of minutes needed to make N
  pieces of takoyaki.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N X T
attempt: h, w, m = map(int, input().split())
  row = [0] * (h + 1)
  col = [0] * (w + 1)
  bombs = set([])
  for i in range(m):
      a, b = map(int, input().split())
      row[a] += 1
      col[b] += 1
      bombs.add((a, b))
  r, c = max(row), max(col)
  rcnt, ccnt = 0, 0
  for v in row:
      if v == r:
          rcnt += 1
  for v in col:
      if v == c:
          ccnt += 1
  doubled = 0
  for i, j in bombs:
      if row[i] == r and col[j] == c:
          doubled += 1
  if doubled == rcnt * ccnt:
      print(r + c - 1)
  else:
      print(r + c)
  
problem_description: Statement
  
  Takahashi loves takoyaki - a ball-shaped snack.
  
  With a takoyaki machine, he can make at most X pieces of takoyaki at a time,
  taking T minutes regardless of the number of pieces to make.
  
  How long does it take to make N takoyaki?
samples: [{"input": "20 12 6", "output": "12\n    \n\nHe can make 12 pieces of takoyaki in the first 6 minutes and 8 more in the\nnext 6 minutes, so he can make 20 in a total of 12 minutes.\n\nNote that being able to make 12 in 6 minutes does not mean he can make 2 in 1\nminute.\n\n* * *"}, {"input": "1000 1 1000", "output": "1000000\n    \n\nIt seems to take a long time to make this kind of takoyaki."}]