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 in C (Clang 3.8.0) (judge verdict: Wrong Answer)

#include <stdio.h>
int main(void)
{
    int i,n,a,b;
    scanf("%d",&n);
    scanf("%d",&a);
    scanf("%d",&b);

    int p[n];

    for(i=0;i<n;i++){
        scanf("%d",&p[i]);
    }

    int x=0,y=0,z=0;
    for(i=0;i<n;i++){
        if(p[i]<=a){x=x+1;}
        if(a<p[i]&&p[i]<=b){y=y+1;}
        if(b<p[i]){z=z+1;}
    }
    
    int min;
    min=x;
    if(min>y){min=y;}
    if(min>z){min=z;}

    printf("%d\n",min);

    return 0;
}