#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;

int main(){
    int a,b,c;
    cin>>a>>b>>c;
    if(c>min(a,b)&&c<max(a,b))cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
}
#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>

int n, h, w;

int main() {
	scanf("%d %d %d", &n, &h, &w);
	printf("%d\n", (n - h + 1) * (n - w + 1));
	return 0;
}