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

Solution (Python):
import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

n, h, w = nin(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()) 

gyou = n - h + 1
retu = n - w + 1

print(gyou * retu)

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

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

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

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
n = ii()
h = ii()
w = ii()

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

Solution (Python):
import sys

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


N = I()
H = I()
W = I()

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

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

Solution (Python):
n = int(input())
m = int(input())
x = int(input())

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


if __name__ == '__main__':
    main()

Solution (Python):
def main():
    board_length = int(input())
    height = int(input())
    width = int(input())
    print((board_length - height + 1) * (board_length - width + 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-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-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):
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())

hh = n+1-h
ww = n+1-w

print(hh*ww)

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

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

if n == h == w:
    print(1)
elif n == w:
    print(n-h+1)
elif n == h:
    print(n-w+1)
else:
    print((n-w+1)*(n-h+1))

Solution (Python):
n,h,w=[int(input()) for _ in range(3)]
print((n-h+1)*(n-w+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())

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

print(h*w)

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

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

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

print(h*w)

Solution (Python):
import sys
import math
import fractions
import bisect
import queue
import heapq
from collections import deque
sys.setrecursionlimit(4100000)

MOD = int(1e9+7)
PI = 3.14159265358979323846264338327950288
INF = 1e18

'''
1行のint
N, K = map(int, input().split())

1行のstring
S, T = input().split()

1行の整数配列
P = list(map(int,input().split()))

改行あり整数
x = []
y = []
for i in range(N):
    x1,y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)

N行M列の初期化
dp = [[INF] * M for i in range(N)]

'''

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

read = sys.stdin.read

N, H, W = map(int, read().split())

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

Solution (Python):
n=int(input())
horizon=int(input())
width=int(input())

answer=(n-horizon+1)*(n-width+1)
print(answer)

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

hh = n+1-h
ww = n+1-w

print(hh*ww)

Solution (Python):
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

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

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

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

def is_prime(a): 
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): 
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): 
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    n = int(input())
    h = int(input())
    w = int(input())
    _h = n - h + 1
    _w = n - w + 1
    print(_h * _w)
    return

if __name__=='__main__':
    main()

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

Solution (Python):
from sys import stdin

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

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

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

px = n - h + 1
py = n - w + 1

p = px * py

print(p)

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

 
import math
import itertools
import sys
import copy
 


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-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 examA():
    N = I(); H = I(); W = I()
    ans = (N-H+1)*(N-W+1)
    print(ans)


import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

if __name__ == '__main__':
    examA()

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 solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    h = int(input().rstrip('\n'))
    w = int(input().rstrip('\n'))
    print((n - h + 1) * (n - w + 1))


if __name__ == '__main__':
    solve()

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


if __name__ == '__main__':
    n = int(input())
    h = int(input())
    w = int(input())

    main(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())
A = int(input())
B = int(input())

print((N-A+1)*(N-B+1))

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

hbaf = n - h + 1
wbaf = n - w + 1
print(hbaf*wbaf)

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

Solution (Python):
import sys
input = sys.stdin.readline
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())

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

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

Solution (Python):

import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random

import os
 




 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N = inputInt()
    H = inputInt()
    W = inputInt()
    
    ans = 0
    if N == H:
        if N == W:
            print(1)
        else:
            print(N-W+1)
    else:
        if N == W:
            print(N-H+1)
        else:
            print((N-H+1) * (N-W+1))
                
    
if __name__ == "__main__":
	main()

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):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10000)
INF = 1<<32


def solve(N: int, H: int, W: int):
    print((N-H+1)*(N-W+1))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    H = int(next(tokens))  
    W = int(next(tokens))  
    solve(N, H, W)

if __name__ == '__main__':
    main()

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

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


if __name__ == '__main__':
    slove()

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):
import math

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

th = N - H + 1
tw = N - W + 1
print(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):
import itertools

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

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

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

Solution (Python):

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

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-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,H,W=[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):
from sys import stdin

def solve() :
    N = int(stdin.readline().rstrip())
    H = int(stdin.readline().rstrip())
    W = int(stdin.readline().rstrip())

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

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

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

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

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

Solution (Python):
def main():

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

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

if __name__ == '__main__':
    print(main())

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

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())
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):
def slove():
    import sys
    input = sys.stdin.readline
    n = int(input().rstrip('\n'))
    h = int(input().rstrip('\n'))
    w = int(input().rstrip('\n'))
    print((n - h + 1) * (n - w + 1))


if __name__ == '__main__':
    slove()

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

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

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

yoko=N-W+1
tate=N-H+1

print ('{}'.format(tate*yoko))

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

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

Solution (Python):
n, h, w = [int(input()) for _ in range(3)]
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())
print((n-int(input())+1)*(n-int(input())+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):
n = int(input())
h = int(input())
w = int(input())
print((n-h+1) * (n-w+1))

Solution (Python):

import sys, math, fractions, itertools


def solve(N: int, H: int, W: int):
    print((N-H+1) * (N-W+1))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    H = int(next(tokens))  
    W = int(next(tokens))  
    solve(N, H, W)

if __name__ == '__main__':
    main()

Solution (Python):

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

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

Solution (Python):
n, h, w = (int(input()) for i in range(3))
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,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=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):
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, H, W = int(input()), int(input()), 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 = list(map(int, [input().rstrip() for _ in range(3)]))
    print((n - h + 1) * (n - w + 1))


if __name__ == "__main__":
    main()

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

n += 1
ans = (n - h) * (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 = list(map(int,input().split()))
H = list(map(int,input().split()))
W = list(map(int,input().split()))
print((N[0]-H[0]+1)*(N[0]-W[0]+1))

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

x = n-w+1
y = n-h+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,H,W = [int(input()) for _ in [0]*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):
n,h,w=int(input()),int(input()),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())
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,h,w=[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-h+1)*(n-w+1))

Solution (Python):
n=int(input())
h=int(input())
w=int(input())
if h>n or w>n:
  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):
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

N, H, W = [int(sys.stdin.readline()) 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())
answer = (N-H+1) * (N-W+1)
print(answer)

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

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

print(ans)

Solution (Python):

import sys
input = sys.stdin.readline
def mi(): return map(int, input().split())


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

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

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-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=n-int(input())+1
w=n-int(input())+1
print(h*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,H,W=[int(input()) for _ in range(3)]
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):
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):
if __name__=="__main__":
    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 = [int(input()) for _ in range(3)]
print((n-h+1)*(n-w+1))

Solution (Python):
n = int(input())+1
a = int(input())
b = int(input())
print((n-a)*(n-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())
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)
if ans < 0:
    print('0')
else:
    print(ans)

Solution (Python):
n,h,w=map(int,open(0));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())

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

print(out)

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

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

print(out)

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