Tomaz and Danftito are playing a game with 3 stacks of rocks, each with a, b and c rocks respectively. Each turn, a player must take from 1 to m rocks from a stack, but they can't empty a stack if there are rocks in any stack to the left. The player that removes the last rock wins. If Tomaz goes first and they take turns playing, determine who will win the game if both players play optimally.
The input contains one line with four integers: m (1 ≤ m ≤ 1018) representing the maximum amount of rocks to be removed in a single turn, a, b and c (1 ≤ a, b, c ≤ 1018) each representing how many rocks there are initially in the first, second and third stacks respectively.
Print "Tomaz" if Tomaz will win the game, and "Danftito" otherwise.
## Input
The input contains one line with four integers: m (1 ≤ m ≤ 1018) representing the maximum amount of rocks to be removed in a single turn, a, b and c (1 ≤ a, b, c ≤ 1018) each representing how many rocks there are initially in the first, second and third stacks respectively.
## Output
Print "Tomaz" if Tomaz will win the game, and "Danftito" otherwise.
[samples]
**Definitions**
Let $ n, x \in \mathbb{Z}_{\geq 0} $ be the number of rooms and initial stone count.
Let $ m \in \mathbb{Z}_{>0} $ be the number of pile descriptions.
For $ i \in \{1, \dots, m\} $, let $ (p_i, q_i, c_i) \in \mathbb{Z}_{\geq 0}^3 $ denote $ c_i $ identical piles of $ p_i $ stones in room $ q_i $.
Let $ Q \in \mathbb{Z}_{>0} $ be the number of queries.
For $ j \in \{1, \dots, Q\} $, let $ (l_j, r_j) \in \mathbb{Z}^2 $ with $ 1 \leq l_j \leq r_j \leq n $ be a query interval.
Define for each room $ k \in \{1, \dots, n\} $:
- $ P_k = \{ p_i \mid q_i = k \} $: set of pile sizes in room $ k $.
- $ C_k(p) = \sum_{i: q_i = k, p_i = p} c_i $: total number of piles of size $ p $ in room $ k $.
**Constraints**
1. $ 1 \leq n \leq 500 $, $ 1 \leq m \leq 10000 $, $ 1 \leq Q \leq \binom{n+1}{2} $
2. $ 0 \leq p_i, x \leq 500 $, $ 1 \leq c_i \leq 10000 $, $ 1 \leq q_i \leq n $
3. $ 1 \leq l_j \leq r_j \leq n $ for all $ j \in \{1, \dots, Q\} $
**Objective**
For each query $ j $, compute the number of ways to select a subset of piles (at most one pile per room) from rooms $ l_j $ to $ r_j $, such that the XOR-sum of selected pile sizes equals $ x $, modulo $ 10007 $.
Formally, for interval $ [l_j, r_j] $, define:
$$
\text{Answer}_j = \left| \left\{ S \subseteq \bigcup_{k=l_j}^{r_j} \left( \{ (p, \text{idx}) \mid p \in P_k, \text{idx} \in \{1, \dots, C_k(p)\} \} \right) \ \middle| \ \begin{array}{c}
|S \cap \text{room } k| \leq 1 \ \forall k \in [l_j, r_j] \\
\bigoplus_{(p, \cdot) \in S} p = x
\end{array} \right\} \right| \mod 10007
$$
Equivalently, using generating functions per room:
Let $ f_k(t) = 1 + \sum_{p \in P_k} C_k(p) \cdot t^p $ for room $ k $, where exponent represents XOR value and coefficient counts ways.
Then:
$$
\text{Answer}_j = \left[ t^x \right] \left( \prod_{k=l_j}^{r_j} f_k(t) \right) \mod 10007
$$