output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      H
      W
attempt: # from sys import stdout
  # from math import *
  # from math import log as lg
  # from bisect import bisect_left as bs
  log = lambda *x: print(*x)
  
  
  def cin(*fn, def_fn=str):
      i, r = 0, []
      if fn:
          def_fn = fn[0]
      for c in input().split(" "):
          r += [(fn[i] if len(fn) > i else def_fn)(c)]
          i += 1
      return r
  
  
  ##################################################
  
  n, h, w = cin(int)
  
  log(round(n / h) * round(n / h))
  
problem_description: Statement
  
  It has been decided that a programming contest sponsored by company A will be
  held, so we will post the notice on a bulletin board.
  
  The bulletin board is in the form of a grid with N rows and N columns, and the
  notice will occupy a rectangular region with H rows and W columns.
  
  How many ways are there to choose where to put the notice so that it
  completely covers exactly HW squares?
samples: [{"input": "3\n    2\n    3", "output": "2\n    \n\nThere are two ways to put the notice, as follows:\n\n    \n    \n    ###   ...\n    ###   ###\n    ...   ###\n    \n\nHere, `#` represents a square covered by the notice, and `.` represents a\nsquare not covered.\n\n* * *"}, {"input": "100\n    1\n    1", "output": "10000\n    \n\n* * *"}, {"input": "5\n    4\n    2", "output": "8"}]