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):
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 = int(input())
h = int(input())
w = int(input())

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

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


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


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007



def A():
    n,h,w = IR(3)
    print((n-h+1)*(n-w+1))
    return


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == "__main__":
    A()

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());print((n-int(input())+1)*(n-int(input())+1))

Solution (Python):
N=int(input())
H=int(input())
W=int(input())
print(str((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, x, y = [int(input()) for _ in range(3)]
print((n - x + 1) * (n - y + 1))

Solution (Python):
n,h,w=eval('int(input()),'*3);print((n+1-h)*(n+1-w))

Solution (Python):
a=lambda:int(input());b=a();print((-~b-a())*(-~b-a()))

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):
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())

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

print(ans)
print()

Solution (Python):
a,b,c=map(int,open(0).read().split())
print((a-b+1)*(a-c+1))

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

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b



def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)



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


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):
N = int(input())
H = int(input())
W = int(input())
print((N-H+1)*(N-W+1))

Solution (Python):
def inint(): return int(input())
n, h, w = inint(), inint(), inint()
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 + 1 - H) * (N + 1 - W))

Solution (Python):
def read():
    return int(input())


def readlist():
    return list(map(int, input().split()))


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


N = read()
H = read()
W = read()

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, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd 
from heapq import heappop, heappush, heapify, heappushpop
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from functools import reduce, partial
from fractions import Fraction
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def round(x): return int((x*2+1) // 2)
def fermat(x, y, MOD): return x * pow(y, MOD-2, MOD) % MOD
def lcm(x, y): return (x * y) // gcd(x, y)
def lcm_list(nums): return reduce(lcm, nums, 1)
def gcd_list(nums): return reduce(gcd, nums, nums[0])
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

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

H2 = N - H + 1
W2 = N - W + 1
print(H2 * W2)

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    n = I()
    h = I()
    w = I()

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



print(main())

Solution (Python):
def bd(n,h,w):
    return (n-h)*(n-w)
print(bd(int(input())+1,int(input()),int(input())))

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 = (1 + (N - H)) * (1 + (N - W))
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())
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 solve(n, h, w):
    return (n-h+1) * (n-w+1)
assert solve(3,2,3) == 2
n = input()
h = input()
w = input()
print(solve(n, 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):



def main():
    n = int(input())
    h = int(input())
    w = int(input())

    print((n - w + 1) * (n - h + 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(raw_input())
h = int(raw_input())
w = int(raw_input())

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

Solution (Python):
n,h,w=map(int, [input() for i 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 = 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())



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())

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())
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):
a=int(input())
b=int(input())
c=int(input())
print((a-b+1)*(a-c+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

s_in = lambda: stdin.readline()[:-1]  
d_in = lambda: int(stdin.readline())  
ds_in = lambda: list(map(int, stdin.readline().split()))  


N = d_in()
H = d_in()
W = d_in()
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 = [int(input()) for _ in range(3)]
result = (N - (H - 1)) * (N - (W - 1))
print(result)

Solution (Python):
a = int(input());b = int(input());c = int(input())
print((a-b+1)*(a-c+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, H, W = [int(input()) for _ in range(3)]

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

Solution (Python):






def main():
    N = int(raw_input().strip())
    H = int(raw_input().strip())
    W = int(raw_input().strip())

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
N = int(raw_input())
H = int(raw_input())
W = int(raw_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())
if H>N:
    print(0)
elif W>N:
    print(0)
else:
    print((N-H+1)*(N-W+1))

Solution (Python):
N, W, H = [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):
import sys

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

    count = 0
    for i in range(0, N):
        for j in range(0, N):
            if i + H <= N and j + W <= N:
                count += 1
    print(count)

if __name__ == "__main__":
    main()

Solution (Python):


import sys


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

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()


N, H, W = [I() for _ in range(3)]
print((N - H + 1) * (N - W + 1))

Solution (Python):
from sys import stdin

N = int(stdin.readline())
H = int(stdin.readline())
W = int(stdin.readline())

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

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

Solution (Python):
n,h,w = map(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=int(input())
h=int(input())
w=int(input())
print((n-h+1)*(n-w+1))

Solution (Python):
import math
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 collections import deque
import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline
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())
w = N - W
h = N - H
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):
n=int(input())
h=int(input())
w=int(input())

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

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())

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

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

ans = (N+1-H)*(N+1-W)
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())
print((n-h+1)*(n-w+1))

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

Solution (Python):

N = input()
H = input()
W = input()

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

Solution (Python):




def solveProblem(boardLength,Height,Width):
	lastHeight = boardLength+1-Height
	lastWidth = boardLength+1-Width

	if ( 0 < lastHeight ) and ( 0 < lastWidth): 
		papers = lastHeight * lastWidth
	else: 
		papers = 0
	answer = papers
	return answer


if __name__ == '__main__':
	N = int(input())
	H = int(input())
	W = int(input())
	solution = solveProblem(N,H,W)
	print("{}".format(solution))

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())

row = n-h+1
line = n-w+1
ans = row * line

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())
 
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())

def con(a):
    hw = 0
    b = n%a
    if a==1:
        return n
   
    for i in reversed(range(n+1-a,n+1)):
        ans = i/a
        hw+=int(ans)
        if ans<=1:
            break
    return hw

re1 = con(h)
re2 = con(w)
print(re2*re1)

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

Solution (Python):

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

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

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

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

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

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

ans = h * w
print(ans)

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

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

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

print((squ-h+1)*(squ-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())

yoko_num = n - h + 1
tate_num = n - w + 1
ans = yoko_num * tate_num

print(ans)

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(int((N-H+1)*(N-W+1)))

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

a=h-1
b=w-1
f=(n-a)*(n-b)

print(f)

Solution (Python):
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)

Solution (Python):
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)

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

print(count)

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

d = a-b+1
c = a-c+1

print(d*c)

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

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

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

Solution (Python):
n = int(input())
row = int(input())
column = int(input())

print((n - row + 1)* (n - column + 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())

if n<h or n<w:
	print("0")

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

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


i = 0
while (h + i) <= n:
 i =  i + 1


j = 1
while (w + j ) <= n:
 j = j +1

print(i*j)

Solution (Python):
N= int(input())
H= int(input())
W = int(input())
if N!=H:
    if N!=W:
        print('{}'.format((N-H+1)*(N-W+1)))
    else:
        print('{}'.format((N-H+1)))
elif N!=W:
    print('{}'.format((N-W+1)))
else:
    print('{}'.format((1)))

Solution (Python):
l = []

for i in range(3):
    l.append(int(input()))

print((l[0]-l[1]+1)*(l[0]-l[2]+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

N=int(input())
H=int(input())
W=int(input())
ans_h=0
ans_w=0
for i in range(N):
    if i+H<=N:
        ans_h+=1
for i in range(N):
    if i+W<=N:
        ans_w+=1
print(ans_h*ans_w)

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())


def main():
    result = (N - H + 1) * (N - W + 1)
    print(result)


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())
Ans = (N+1-H)*(N+1-W)
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())

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

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

a = (n-h+1) * (n-w+1)

print(a)

Solution (Python):
import math

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 - H) + 1) * ((N - W) + 1))

Solution (Python):
from math import *
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, = cin(int)
h, = cin(int)
w, = cin(int)

tw, th = 0, 0

while h <= n:
    h += 1
    th += 1

while w <= n:
    tw += 1
    w += 1

log(th * tw)

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-w+1)*(n-h+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())

n=N-H+1
w=N-W+1

print(n*w)

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

Solution (Python):
n = int(raw_input())
h = int(raw_input())
w = int(raw_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())
x = (N - H + 1) * (N - W + 1)
print(x)

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

H = int(input())

W = int(input())


ans1 = N  - W + 1
ans2 = N - H + 1






ans = ans1 * ans2

print(ans)

Solution (Python):
def main():
    N = int(input())
    H = int(input())
    W = int(input())
    count = 0
    for i in range(N):
        for j in range(N):
            if (N - i) >= H and (N - j) >= W:
                count += 1
    print(count)


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())

height = (N + 1) - H
weight = (N + 1) - W

print(height*weight)

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

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=int(0)

x=(n-h+1)*(n-w+1)

print(x)

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

Solution (Python):


N = int(input())
H = int(input())
W = int(input())

print("{}".format((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

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

remainder_row = n-h
remainder_col = n-w
total_row = remainder_row + 1
total_col = remainder_col + 1
combi_row = math.factorial(total_row) / math.factorial(remainder_row)
combi_col = math.factorial(total_col) / math.factorial(remainder_col)

print(int(combi_row * combi_col))

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())

h_candidate = N - H + 1
w_candidate = N - W + 1

print(h_candidate * w_candidate)

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

Solution (Python):
data = []

for i in range(3):
    data.append(input())
    
N = int(data[0])
H = int(data[1])
W = int(data[2])

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

Solution (Python):
import sys, copy, math, collections, itertools

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

i=n-h+1
j=n-w+1

print(i*j)

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

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):
def main():
    N = int(input())
    H = int(input())
    W = int(input())

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

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
from sys import stdin, stdout
from math import sin, tan, cos, pi, atan2, sqrt, acos, atan, factorial
from random import randint

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

stdout.write(str((n - h + 1) * (n - w + 1)))

Solution (Python):
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N] = [long(input_raw[0])]
    input_raw = read_func().strip().split()
    [H] = [long(input_raw[0])]
    input_raw = read_func().strip().split()
    [W] = [long(input_raw[0])]

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

if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np

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

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())
tate=1
yoko=1
if N>W:
    tate=tate+N-W
if N>H:
    yoko=yoko+N-H
print(tate*yoko)

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

count = 0
for i in range(N):
    for j in range(N):
        if i + W <= N and j + H <= N:
            count += 1

print(count)

Solution (Python):
N = int(input())
H = int(input())
W = int(input())
if H > N or W > N:
	print(0)
else:
	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())

X=N-H+1
Y=N-W+1


print(X*Y)

Solution (Python):
N=input()
H=input()
W=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 = 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):
def question1():
    n = int(input())
    h = int(input())
    w = int(input())
    result =  (n-w+1)*(n-h+1)
    print(result)
    return result

question1()

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())
print((N+1-W) * (N+1-H))

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())

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())
W = int(input())
H = 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))