Problem:
 Score : 100 points    Problem 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?      Constraints  1 \leq H, W \leq N \leq 100  All values in input are integers.         Input Input is given from Standard Input in the following format:  N  H  W       Output Print the answer.        Sample Input 1 3
2
3      Sample Output 1 2  There are two ways to put the notice, as follows:  ###   ...
###   ###
...   ###  Here, # represents a square covered by the notice, and . represents a square not covered.       Sample Input 2 100
1
1      Sample Output 2 10000       Sample Input 3 5
4
2      Sample Output 3 8

Solution (Python):
p=int(input())+1
print((p-int(input()))*(p-int(input())))

Solution (Python):
n=int(input())
h=int(input())
w=int(input())

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n+1-h)*(n+1-w))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N - H + 1) * (N - W + 1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N+1-H)*(N+1-W))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n+1-h)*(n+1-w))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
ans = (n-h+1)*(n-w+1)
print(ans)

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n - h + 1) * (n - w + 1))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())

if N<H or N<W:
    print(0)
    exit()

h = N-H
w = N-W

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
N=int(input())
H=int(input())
W=int(input())

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    N = int(readline())
    H = int(readline())
    W = int(readline())

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


if __name__ == '__main__':
    main()

Solution (Python):

import sys
def input():
    return sys.stdin.readline()[:-1]

def main():
    N = int(input())
    H = int(input())
    W = int(input())

    h = N - H + 1
    w = N - W + 1
    print(h * w)

if __name__ == '__main__':
    main()

Solution (Python):
def main():
    n, h, w = int(input()), int(input()), int(input())

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


if __name__ == "__main__":
    main()

Solution (Python):

n=int(input())
h=int(input())
w=int(input())
s = n-h+1
t = n-w+1
print(s*t)

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1) * (n-w+1))

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
n = I()
h = I()
w = I()
x = n-h+1
y = n-w+1
print(x*y)

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
N = int (input ())
H = int (input ())
W = int (input ())
X = N-H+1
Y = N-W+1
print (X*Y)

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
a = int(input())
b = int(input())
print((n - a + 1) * (n - b + 1) )

Solution (Python):
N=int(input())
H=int(input())
W=int(input())

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

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rf = lambda: map(float, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

n = ri()
h = ri()-1
w = ri()-1
print((n-h) * (n-w))

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    N = I()
    H = I()
    W = I()

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

if __name__ == '__main__':
    resolve()

Solution (Python):
N=int(input())
H=int(input())
W=int(input())
print((N-W+1)*(N-H+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):

n=int(input())
h=int(input())
w=int(input())
ans=(n-h+1)*(n-w+1)
print(ans)

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
print((n - int(input()) + 1) * (n - int(input()) + 1))

Solution (Python):
n,h,w=map(int,open(0).read().split())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
ans = (n-w+1)*(n-h+1)
print(ans)

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n - h + 1) * (n - w + 1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
if n < h or n < w:
    print(0)
else:
    print((n-h+1)*(n-w+1))

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

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

Solution (Python):
n, h, w = [int(input()) for _ in range(3)]

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n -w+1) *(n -h +1))

Solution (Python):
N=int(input())
H=int(input())
W=int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n - h + 1) * (n - w + 1))

Solution (Python):
import math
import sys
readline = sys.stdin.readline


def main():
    n = int(input())
    print((n - int(input()) + 1) * (n - int(input()) + 1))


if __name__ == '__main__':
    main()

Solution (Python):
N=int(input())
H=int(input())
W=int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

a = n - h + 1
b = n - w + 1

print(a*b)

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N-H+1) * (N-W+1))

Solution (Python):
n = int(input())
a = int(input())
b = int(input())
print((n - a + 1) * (n - b + 1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n + 1 - h) * (n + 1 - w))

Solution (Python):
n=int(input())
m=int(input())
h=int(input())
print((n-m+1)*(n-h+1))

Solution (Python):
import sys, math
from functools import lru_cache
from collections import deque
sys.setrecursionlimit(500000)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]

def main():
    N, H, W = [ii(), ii(), ii()]
    print((N-H+1)*(N-W+1))


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):


N = int(input())
h = int(input())
w = int(input())



ans = 0
if h*w!=0:
    print((N-h+1)*(N-w+1))
else:
    print((N-h+1)+(N-w+1))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N-W+1)*(N-H+1))

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n - h + 1) * (n - w + 1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

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

Solution (Python):


import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union































def main():
    Num = Union[int, float]
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input():  return sys.stdin.readline().rstrip()
    def ii():     return int(input())
    def isp():    return input().split()
    def mi():     return map(int, input().split())
    def mi_0():   return map(lambda x: int(x)-1, input().split())
    def lmi():    return list(map(int, input().split()))
    def lmi_0():  return list(map(lambda x: int(x)-1, input().split()))
    def li():     return list(input())
    def debug(x): print(x, file=sys.stderr)
    
    
    
    n, h, w = ii(), ii(), ii()
    print((n - h + 1) * (n - w + 1))
    


if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
ans = (n - h + 1) * (n - w + 1)
print(ans)

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    N = int(input())
    H = int(input())
    W = int(input())
 
    ans = (N + 1 - H) * (N + 1 - W)

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n - h + 1) * (n - w + 1))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):
N=int(input())
H=int(input())
W=int(input())
t=N-H+1
s=N-W+1
print(t*s)

Solution (Python):
N = int(input())
print((N-int(input())+1)*(N-int(input())+1))

Solution (Python):
N=int(input())
H=int(input())
W=int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print(max(0,n-w+1)*max(0,n-h+1))

Solution (Python):
N=int(input())
H=int(input())
W=int(input())

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

Solution (Python):
n=int(input())
h=int(input())
w=int(input())

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

Solution (Python):

from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement


n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
N=int(input())
H=int(input())
W=int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
N=int(input())
H=int(input())
W=int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
def main():
    N = int(input())
    H = int(input())
    W = int(input())
    print((N - H + 1)*(N - W + 1))


if __name__ == '__main__':
    main()

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque, defaultdict


from collections import Counter

from itertools import accumulate,combinations,permutations,product

from heapq import heapify,heappop,heappush


from functools import reduce,lru_cache

from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    

    N = int(input())
    h=int(input())
    w=int(input())
    
    
    
    

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




if __name__ == "__main__":
    main()

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N-H+1) * (N-W+1))

Solution (Python):
def main():
    n,h,w=[int(input()) for _ in range(3)]
    print((n-h+1) * (n-w+1))

if __name__ == "__main__":
    main()

Solution (Python):
def main():
    n=int(input())
    h=int(input())
    w=int(input())
    print((n-h+1) * (n-w+1))
    
if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
import sys




from collections import deque


import bisect


def input():
    return sys.stdin.readline().rstrip()


def main():
    N = int(input())
    H = int(input())
    W = int(input())

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


if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
H = int(input())
W = int(input())

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

Solution (Python):
N,H,W=map(int,open(0))
print((N-H+1)*(N-W+1))

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
H = INT()
W = INT()

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    n=II()
    h=II()
    w=II()
    print((n-h+1)*(n-w+1))

main()

Solution (Python):
def main():
  n = int(input())
  h = int(input())
  w = int(input())
  print((n - h + 1) * (n - w + 1))
if __name__ == '__main__':
  main()

Solution (Python):
import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    N=I()
    H=I()
    W=I()
    ans=(N-H+1)*(N-W+1)
    print(ans)

main()

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N - H + 1) * (N - W + 1))

Solution (Python):
n = int(input())
h = int(input()) - 1
w = int(input()) - 1
print((n-h)*(n-w))

Solution (Python):
def main():
    a=int(input())
    b=int(input())
    c=int(input())
    print((a-b+1)*(a-c+1))

main()

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N+1-H)*(N+1-W))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print(max(0, (n - h + 1) * (n - w + 1)))

Solution (Python):
n=int(input())
h=int(input())
w=int(input())

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

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):
n, h, w = map(int, open(0))
print((n-h+1)*(n-w+1))

Solution (Python):
N=int(input())
H=int(input())
W=int(input())

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

Solution (Python):
n=int(input())
h=n-int(input())+1
w=n-int(input())+1
print(h*w)

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
ans = (n - h + 1) * (n - w + 1)
print(ans)

Solution (Python):
def resolve():
    N = int(input())
    H = int(input())
    W = int(input())
    print((N-H+1)*(N-W+1))
resolve()

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7


N = INT()
H = INT()
W = INT()

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

Solution (Python):
n=int(input())
h=int(input())
w=int(input())

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

Solution (Python):
N = int(input())
H = int(input())
W = int(input())

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

Solution (Python):
N = int(input())
H = int(input())
W = int(input())

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

Solution (Python):
n=int(input())
h=int(input())
w=int(input())

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]


def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()


def DD(arg): return defaultdict(arg)



def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


def lcm(a, b):
    return a * b // gcd (a, b)


def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count





N,H,W = ILs(3)

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

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
ans=(n-h+1)*(n-w+1)
print(ans)

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    N = int(readline())
    H = int(readline())
    W = int(readline())
    ans = (N-H+1)*(N-W+1)
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
a = int(input())
b = int(input())

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

print(ans)

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
from statistics import median


from fractions import gcd
from itertools import combinations 
from collections import deque
from collections import defaultdict
import bisect










import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    n = int(input())
    H = int(input())
    W = int(input())

    res = (n - H + 1) * (n - W + 1)
    print(res)


if __name__ == '__main__':
    resolve()

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n - h + 1) * (n - w + 1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
ans = (n-h+1)*(n-w+1)
print(ans)

Solution (Python):
from sys import stdin
import math
import re
import queue

input = stdin.readline

MOD = 1000000007
INF = 122337203685477580

def solve():
    N = int(input().rstrip())
    H = int(input().rstrip())
    W = int(input().rstrip())
    
    print((H-N)*(W-N) + N - H + N - W + 1)
if __name__ == '__main__':
    solve()

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
ans = (N-H+1) * (N-W+1)
print(ans)

Solution (Python):
n,h,w = map(int,open(0).read().split())
print((n-h+1)*(n-w+1))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
N=int(input())
H=int(input())
W=int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
N=int(input())
H=int(input())
W=int(input())
h=N-H+1
w=N-W+1
print(h*w)

Solution (Python):
n = int(input())+1
h = int(input())
w = int(input())

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

tate = n-h+1
yoko = n-w+1

print(tate*yoko)

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n + 1 - h) * (n + 1 - w))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n - h + 1) * (n - w + 1))

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    h=int(input())
    w=int(input())
    print((n-h+1)*(n-w+1))
resolve()

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():

    n=int(input())
    h=int(input())
    w=int(input())

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

resolve()

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

Solution (Python):
N=int(input())
H=int(input())
W=int(input())
print((N-H+1)*(N-W+1))

Solution (Python):


if False:
    print('YES' if set(input().split())==set(list('1974')) else 'NO')



if False:
    S=input()
    ans='NO'
    K='keyence'
    for i in range(len(K)):
        l=K[:i]
        r=K[i:]
        
        if l in S and r in S:
            l_i=S.index(l)
            for j in range(len(S)):
                
                if j+len(r)-1<len(S) and S[j:j+len(r)]==r:
                    r_i=j
            
            if l_i<=r_i:
                ans='YES'
                break
    print(ans)



N=int(input())
H=int(input())
W=int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
print((n - h + 1) * (n - w + 1))

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

    n = int(input())
    h = int(input())
    w = int(input())
    print((n-h+1)*(n-w+1))

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
a = (n-h+1) * (n-w+1)
print(a)

Solution (Python):
N = int(input())
H = int(input())
W = int(input())

if N < W or N < H:
    print(0)
else:
    print((N-W+1)*(N-H+1))

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

n = int(readline())
h = int(readline())
w = int(readline())
print((n - h + 1) * (n - w + 1))

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    n=int(input())
    h=int(input())
    w=int(input())
    print((n-h+1)*(n-w+1))

if __name__=='__main__':
    main()

Solution (Python):
n = int(input())
h = int(input())
w = int(input())
ans = (n - h + 1) * (n - w + 1)
print(ans)

Solution (Python):
n, h, w = map(int, open(0))
print((n - ~-h)*(n - ~-w))

Solution (Python):
n = int(input())
a = int(input())
b = int(input())
print((n-a+1)*(n-b+1))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N-H+1) * (N-W+1))

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
print((a - b + 1) * (a - c + 1))

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):
N = int(input())
H = int(input())
W = int(input())

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

Solution (Python):
from sys import stdin

n = int(stdin.readline().rstrip())
h = int(stdin.readline().rstrip())
w = int(stdin.readline().rstrip())

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

Solution (Python):
n = int(input())
h = int(input())
w = int(input())

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

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
a=n-h+1
b=n-w+1
print(a*b)

Solution (Python):
N = int(input())
H = int(input())
W = int(input())

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

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
print((N - H + 1) * (N - W + 1))

Solution (Python):
N = int(input())
H = int(input())
W = int(input())

def solve(i, j):
    for a in range(H):
        for b in range(W):
            if 0 <= i + a < N and 0 <= j + b < N:
                continue
            else:
                return False
    return True

ans = 0

for i in range(N):
    for j in range(N):
        if solve(i, j):
            ans += 1

print(ans)