写出程序计算所有 $(n + 1)(m + 1)$ 种状态是必胜态还是必败态。列出表格，观察图形性质，可得：



| $n \\bmod 3 =$ | $m \\bmod 6 =$ | 答案 |

| :-: | :-: | :-: |

| $0$ | $0$ | Sleeping Alligator |

| $0$ | $1$ | Sleeping Iguana |

| $0$ | $2$ | Sleeping Iguana |

| $0$ | $3$ | Sleeping Alligator |

| $0$ | $4$ | Sleeping Alligator |

| $0$ | $5$ | Sleeping Alligator |

| $1$ | $0$ | Sleeping Iguana |

| $1$ | $1$ | Sleeping Alligator |

| $1$ | $2$ | Sleeping Iguana |

| $1$ | $3$ | Sleeping Alligator |

| $1$ | $4$ | Sleeping Iguana |

| $1$ | $5$ | Sleeping Iguana |

| $2$ | $0$ | Sleeping Alligator |

| $2$ | $1$ | Sleeping Iguana |

| $2$ | $2$ | Sleeping Alligator |

| $2$ | $3$ | Sleeping Iguana |

| $2$ | $4$ | Sleeping Iguana |

| $2$ | $5$ | Sleeping Iguana |



