1 #include <cstdio>
  2 #include <iostream>
  3 #include <cstring>
  4 #include <set>
  5 using namespace std;
  6 struct Cell{
  7     int x, y;
  8     Cell(int x=0, int y=0):x(x),y(y) {}
  9     bool operator < (const Cell &a) const{
 10         return x<a.x || (x==a.x && y<a.y);
 11     }
 12 };
 13 int maxn=10, dir[4][2]={0,1,0,-1,1,0,-1,0};
 14 int n, h, w, ans[11][11][11]={0}, vis[11][11];
 15 typedef set<Cell> Poly;
 16 set<Poly> state[11];
 17
 18 inline Poly move(Poly &p){
 19     int mx=maxn, my=maxn;
 20     Poly p2;
 21     for (Poly::iterator c=p.begin(); c!=p.end(); ++c){
 22         if (mx>c->x) mx=c->x;
 23         if (my>c->y) my=c->y;
 24     }
 25     for (Poly::iterator c=p.begin(); c!=p.end(); ++c)
 26         p2.insert(Cell(c->x-mx, c->y-my));
 27     return p2;
 28 }
 29
 30 inline Poly rote(Poly &p){
 31     Poly p2;
 32     for (Poly::iterator c=p.begin(); c!=p.end(); ++c)
 33         p2.insert(Cell(c->y, -(c->x)));
 34     return move(p2);
 35 }
 36
 37 inline Poly mirror(Poly &p){
 38     Poly p2;
 39     for (Poly::iterator c=p.begin(); c!=p.end(); ++c)
 40         p2.insert(Cell(c->x, -(c->y)));
 41     return move(p2);
 42 }
 43
 44 void check(Poly p, Cell &c){
 45     p.insert(c);
 46     p=move(p);
 47     if (state[n].count(p)) return;
 48     for (int i=0; i<3; i++){
 49         p=rote(p);
 50         if (state[n].count(p)) return;
 51     }
 52     p=mirror(p);
 53     if (state[n].count(p)) return;
 54     for (int i=0; i<3; i++){
 55         p=rote(p);
 56         if (state[n].count(p)) return;
 57     }
 58     p=move(p);
 59     state[n].insert(p);
 60 }
 61
 62 void pre(void){
 63     Poly p;
 64     p.insert(Cell(0, 0));
 65     state[1].insert(p);
 66
 67     for (n=2; n<=maxn; n++)
 68         for (set<Poly>::iterator p=state[n-1].begin(); p!=state[n-1].end(); ++p)
 69             for (Poly::iterator c=(*p).begin(); c!=(*p).end(); ++c)
 70                 for (int j=0; j<4; j++){
 71                     Cell nc((c->x)+dir[j][0], (c->y)+dir[j][1]);
 72                     if (!(p->count(nc))) check(*p, nc);
 73                 }
 74     for (n=2; n<=maxn; n++){
 75         for (set<Poly>::iterator p=state[n].begin(); p!=state[n].end(); ++p){
 76             int maxx=0, maxy=0;
 77             for (Poly::iterator c=(*p).begin(); c!=(*p).end(); ++c){
 78                 if (maxx<(c->x)) maxx=(c->x);
 79                 if (maxy<(c->y)) maxy=(c->y);
 80             }
 81             if (maxx>maxy) ans[n][maxx+1][maxy+1]++;
 82             else ans[n][maxy+1][maxx+1]++;
 83         }
 84     }
 85 }
 86
 87 int show(int w, int h){
 88     int spr=(w>h)?w:h, mnr=(w!=spr)?w:h, re=0;
 89     for (int i=1; i<=spr; i++)
 90         for (int j=1; j<=mnr; j++)
 91             if (i>=j) re+=ans[n][i][j];
 92     return re;
 93 }
 94
 95 int main(void){
 96     pre();
 97
 98     while(scanf("%d%d%d", &n, &h, &w)==3 && n)
 99         printf("%d\n", (n==1)?1:show(w, h));
100
101     return 0;
102 }