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

"""
This file is part of https://github.com/Cheran-Senthil/PyRival.

Copyright 2018 Cheran Senthilkumar all rights reserved,
Cheran Senthilkumar <hello@cheran.io>
Permission to use, modify, and distribute this software is given under the
terms of the MIT License.

"""
from __future__ import division, print_function

import cmath
import itertools
import math
import operator as op

import sys
from atexit import register
from bisect import bisect_left, bisect_right







if sys.version_info[0] < 3:
    
    from io import BytesIO as stream
    
else:
    
    from io import StringIO as stream
    
    


if sys.version_info[0] < 3:
    class dict(dict):
        """dict() -> new empty dictionary"""
        def items(self):
            """D.items() -> a set-like object providing a view on D's items"""
            return dict.iteritems(self)

        def keys(self):
            """D.keys() -> a set-like object providing a view on D's keys"""
            return dict.iterkeys(self)

        def values(self):
            """D.values() -> an object providing a view on D's values"""
            return dict.itervalues(self)

    input = raw_input
    range = xrange

    filter = itertools.ifilter
    map = itertools.imap
    zip = itertools.izip


def sync_with_stdio(sync=True):
    """Set whether the standard Python streams are allowed to buffer their I/O.

    Args:
        sync (bool, optional): The new synchronization setting.

    """
    global input, flush

    if sync:
        flush = sys.stdout.flush
    else:
        sys.stdin = stream(sys.stdin.read())
        input = lambda: sys.stdin.readline().rstrip('\r\n')

        sys.stdout = stream()
        register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))


def gcd(x, y):
    """greatest common divisor of x and y"""
    while y:
        x, y = y, x % y
    return x


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

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


if __name__ == '__main__':
    sync_with_stdio(False)
    main()

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

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

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

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

Solution (Python):
import sys
import math
input = sys.stdin.readline
N = int(input())
H = int(input())
W = int(input())
print((N-H+1)*(N-W+1))

Solution (Python):



import array
from bisect import *
from collections import *
import fractions
import heapq 
from itertools import *
import math
import random
import re
import string
import sys

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

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

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

Solution (Python):
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

n = ni()
h = ni()
w = ni()
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())
x = int(input())
y = int(input())

print((n-x+1) * (n-y+1))