You are tasked with finding the number of ways to place a notice on a bulletin board grid so that it completely covers a specified number of squares. The bulletin board is an N x N grid, and the notice occupies an H x W rectangular region. You need to determine the number of ways to position the notice to cover exactly H * W squares. The input consists of N, H, and W, and the output should be the number of ways to place the notice. The constraints are 1 ≤ H, W ≤ N ≤ 100, and all input values are integers.

# Buggy version:
n = int(input())
a = int(input())
b = int(input())

ans = (n-a+1)+(n-b+1)

print(ans)

# Fixed version:
n = int(input())
a = int(input())
b = int(input())

ans = (n-a+1)*(n-b+1)

print(ans)

# Buggy version:
n,h,w=[int(input()) for _ in range(3)]
print((n-h+1)+(n-w+1))

# Fixed version:
n,h,w=[int(input()) for _ in range(3)];print((n+1-h)*(n+1-w))

# Buggy version:
def main():
  import sys
  n,h,w=map(int,open(0).read().split())
  ans=(n-h-1)*(n-w+1)
  print(ans)
if __name__=="__main__":
  main()

# Fixed version:
def main():
  import sys
  n,h,w=map(int,open(0).read().split())
  ans=(n-h+1)*(n-w+1)
  print(ans)
if __name__=="__main__":
  main()

# Buggy version:
n = list[int(input()) for i in range(3)]
print((n[0] - n[1] + 1) * (n[0] - n[2] + 1) )

# Fixed version:
n = [int(input()) for i in range(3)]
print((n[0] - n[1] + 1) * (n[0] - n[2] + 1) )

# Buggy version:
n,h,w=map(int,open(0).read().split);print((n-h+1)*(n-w+1))

# Fixed version:
n,h,w=map(int,open(0).read().split());print((n-h+1)*(n-w+1))

# Buggy version:
n,h,w=[int(input()) for _ in range(3)]
print((n-h)*2+(n-w)*2)

# Fixed version:
n, h, w = [int(input()) for _ in range(3)]
print((n-w+1)*(n-h+1))

# Buggy version:
n,h,w=map(int, input() for i in range(3))
 
print( (n - h + 1) * (n - w + 1))

# Fixed version:
n,h,w = map(int,(input() for _ in range(3)))

print((n-h+1)*(n-w+1))

# Buggy version:
N = int(input())
H = int(input())
W = int(input())
 
ANS = (N-(H-1))(N-(W-1))
 
print(ANS)

# Fixed version:
N = int(input())
H = int(input())
W = int(input())
 
ANS = (N-(H-1))*(N-(W-1))
 
print(ANS)

# Buggy version:
N, H, W = [int(input()) for _ in range(3)]
print((N - H) * (N - W))


# Fixed version:
N, H, W = [int(input()) for _ in range(3)]
print((N - H + 1) * (N - W + 1))

# Buggy version:
N = int(input())
H = int(input())
W = int(input())

NH = 0
NW = 0

if(N - H != 0):
  NH = N - H + 1
  
if(N - W != 0):
  NW = N - W + 1
  
print(NH + NW)

# Fixed version:
N = int(input())
H = int(input())
W = int(input())

NH = 1
NW = 1

if(N - H != 0):
  NH = N - H + 1
if(N - W != 0):
  NW = N - W + 1

print(NH * NW)

# Buggy version:
import sys

lines = sys.stdin.readlines()

N = lines[0]
H = lines[1]
W = lines[2]

p_row = H - N + 1
p_column = W - N + 1

ans = p_row * p_column
print(ans)



# Fixed version:
import sys

lines = sys.stdin.readlines()

N = int(lines[0])
H = int(lines[1])
W = int(lines[2])

p_row = N - H + 1
p_column = N - W + 1

ans = p_row * p_column
print(ans)

# Buggy version:
N, H, W = input(), input(), input()
print((N-H+1)*(N-W+1))

# Fixed version:
N, H, W = int(input()), int(input()), int(input())

print((N - H + 1) * (N - W + 1))

# Buggy version:
n1=input()
n2=input()
n3=input()
out=(n1-n2+1)*(n1-n3+1)
print(out)

# Fixed version:
n1=int(input())
n2=int(input())
n3=int(input())
out=(n1-n2+1)*(n1-n3+1)
print(out)

# Buggy version:
N,H,W=[input() for i in range(3)]
print((N-H+1)*(N-W+1))

# Fixed version:
N, H, W = [int(input()) for i in range(0, 3)]

print((N - H + 1) * (N - W + 1))

# Buggy version:
N,H,W=[int(input()) in _ for range(3)]
print((N-H+1)*(N-W+1))

# Fixed version:
N, H, W = [int(input()) for i in range(3)]

print((N - H + 1) * (N - W + 1))

# Buggy version:
#coding:utf-8
n = input()
h = input()
w = input()

print((n-h+1)*(n-w+1))


# Fixed version:
# -*- coding: utf-8 -*-
n = int(input())
h = int(input())
w = int(input())

print((n-w+1)*(n-h+1))

# Buggy version:
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(w-h+1))

# Fixed version:
n =int(input())
h = int(input())
w = int(input())
print((n-w+1)*(n-h+1))

# Buggy version:
N=int(input())
H=int(input())
W==int(input())
print((N-H+1)*(N-W+1))

# Fixed version:
N = int(input())
H = int(input())
W = int(input())
print(str((N - H + 1) * (N - W + 1)))