#include<set>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>using namespace std;int ans[11][11][11];struct  Cell
{int x,y;Cell(int x=0,int y=0):x(x),y(y) { }bool operator < (const Cell & rhs) const{if(x!=rhs.x) return x<rhs.x;return y<rhs.y; }
};
typedef set<Cell> polyomino;
set<polyomino> sp[11];const int dir_x[]={-1,1,0,0};
const int dir_y[]={0,0,-1,1};inline polyomino normalize(const polyomino &p)
{int minx=p.begin()->x,miny=p.begin()->y;for(polyomino :: const_iterator it=p.begin();it!=p.end();it++){minx=min(minx,it->x);miny=min(miny,it->y);}polyomino tmp;for(polyomino :: const_iterator it=p.begin();it!=p.end();it++){int x=it->x,y=it->y;tmp.insert(Cell(x-minx,y-miny));}return tmp;
}inline polyomino rotation(const polyomino &p)
{polyomino tmp;for(polyomino :: const_iterator it=p.begin();it!=p.end();it++){int x=it->x,y=it->y;tmp.insert(Cell(y,-x));}return normalize(tmp);
}inline polyomino flip_x(const polyomino &p)
{polyomino tmp;for(polyomino :: const_iterator it=p.begin();it!=p.end();it++){int x=it->x,y=it->y;tmp.insert(Cell(x,-y));}return normalize(tmp);} void set_poly(const polyomino & p,const Cell &c)
{polyomino tmp=p;tmp.insert(c);tmp=normalize(tmp);int n=tmp.size();for(int i=0;i<4;i++){if(sp[n].count(tmp)) return;tmp=rotation(tmp);} tmp=flip_x(tmp);for(int i=0;i<4;i++){if(sp[n].count(tmp)) return;tmp=rotation(tmp);}sp[n].insert(tmp);
}void make_Ans_List()
{polyomino cur;cur.insert(Cell(0,0));sp[1].insert(cur);for(int n=1;n<=10;n++)for(set<polyomino>::iterator it=sp[n-1].begin();it!=sp[n-1].end();it++)for(polyomino ::const_iterator cit=(*it).begin();cit!=(*it).end();cit++)for(int dir=0;dir<4;dir++){Cell newc(cit->x+dir_x[dir],cit->y+dir_y[dir]);if((it->count(newc))==0) set_poly(*it,newc);}for(int n=1;n<=10;n++)for(int w=1;w<=10;w++)for(int h=1;h<=10;h++){int cnt=0;for(set<polyomino>::iterator it=sp[n].begin();it!=sp[n].end();it++){int maxx=0,maxy=0;for(polyomino :: const_iterator c=(*it).begin();c!=(*it).end();c++){maxx=max(maxx,c->x);maxy=max(maxy,c->y);}if(min(maxx,maxy)<min(w,h) && max(maxx,maxy)<max(w,h)) cnt++;}ans[n][w][h]=cnt;}} int main()
{make_Ans_List();int n,w,h;while(scanf("%d%d%d",&n,&w,&h)!=EOF){if(n>w*h) printf("0\n");else printf("%d\n",ans[n][w][h]);}
}