AtCoder Beginner Contest 190
A
Very Very Primitive Game
AtCoder
⌀ 0
原题
←B →
翻译中…

Problem Statement

翻译中…

Takahashi and Aoki will play a game against each other. Initially, Takahashi and Aoki have $A$ and $B$ candies, respectively. They will alternately do the operation below. Takahashi goes first if $C=0$, and Aoki goes first if $C=1$.

翻译中…
  • Eat one of the candies he has.
翻译中…

The person who first becomes unable to do the operation loses. Which person will win?

翻译中…

Constraints

翻译中…
  • All values in input are integers.
  • $0 ≤ A, B ≤ 100$
  • $C \in \{0, 1\}$
翻译中…

Input

翻译中…

Input is given from Standard Input in the following format:

翻译中…

A B C

翻译中…

Output

翻译中…

If Takahashi will win, print Takahashi; if Aoki will win, print Aoki.

翻译中…

样例

Input #1
2 1 0
Output #1
Takahashi
Initially, Takahashi and Aoki have $2$ and $1$ candy(ies), respectively. The game will proceed as follows: - Takahashi eats his candy. - Aoki eats his candy. - Takahashi eats his candy. - Aoki has no more candies, so Takahashi wins.
Input #2
2 2 0
Output #2
Aoki
Input #3
2 2 1
Output #3
Takahashi
题目信息
题号
abc190_a
时间限制
2 s
内存限制
1024 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。