Contest Duration: - (local time) (100 minutes) Back to Home
A - Jogging /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 制約

• 1 \leq A, B, C, D, E, F, X \leq 100
• 入力は全て整数

### 入力

A B C D E F X


### 入力例 1

4 3 3 6 2 5 10


### 出力例 1

Takahashi


• 高橋君は 4 秒間歩き、3 秒間休んだ後、再び 3 秒間歩く。合計 (4 + 3) \times 3 = 21 メートル歩く。
• 青木君は 6 秒間歩き、4 秒間休む。合計 6 \times 2 = 12 メートル歩く。

### 入力例 2

3 1 4 1 5 9 2


### 出力例 2

Aoki


### 入力例 3

1 1 1 1 1 1 1


### 出力例 3

Draw


Score : 100 points

### Problem Statement

Takahashi and Aoki decided to jog.
Takahashi repeats the following: "walk at B meters a second for A seconds and take a rest for C seconds."
Aoki repeats the following: "walk at E meters a second for D seconds and take a rest for F seconds."
When X seconds have passed since they simultaneously started to jog, which of Takahashi and Aoki goes ahead?

### Constraints

• 1 \leq A, B, C, D, E, F, X \leq 100
• All values in input are integers.

### Input

Input is given from Standard Input in the following format:

A B C D E F X


### Output

When X seconds have passed since they simultaneously started to jog, if Takahashi goes ahead of Aoki, print Takahashi; if Aoki goes ahead of Takahashi, print Aoki; if they have advanced the same distance, print Draw.

### Sample Input 1

4 3 3 6 2 5 10


### Sample Output 1

Takahashi


During the first 10 seconds after they started to jog, they move as follows.

• Takahashi walks for 4 seconds, takes a rest for 3 seconds, and walks again for 3 seconds. As a result, he advances a total of (4 + 3) \times 3 = 21 meters.
• Aoki walks for 6 seconds and takes a rest for 4 seconds. As a result, he advances a total of 6 \times 2 = 12 meters.

Since Takahashi goes ahead, Takahashi should be printed.

### Sample Input 2

3 1 4 1 5 9 2


### Sample Output 2

Aoki


### Sample Input 3

1 1 1 1 1 1 1


### Sample Output 3

Draw