ZUFEOJ Home ProblemSet Source/Category Contest Status Ranklist F.A.Qs
Login Register

5698: Kicker

内存限制：256 MB 时间限制：1 S 标准输入输出
题目类型：传统 评测方式：文本比较 上传者：
提交：3 通过：2
提交提交记录统计Web Board

题目描述

踢球者（桌上足球）是一款棋盘游戏在足球上，解放军Yers通过使用杠铃将球送入对手的球门来控制安装在杆上的足球运动员的身影。玩二对二时，一对二每支球队控制守门员和边后卫（防守），另一支球队耶尔控制半后卫和前锋（打进攻）。
        Q连的两支队伍决定交战。让我们枚举玩家从 1 到 4 的整数。第一和第二在一线队踢球，第三和第四在二队踢球。对于四个中的每一个我们知道他们在防守和进攻方面的比赛技巧。防御技巧是ai，攻击技能是bi.
        在比赛之前，球队决定他们将如何比赛。首先，一线队的人民决定谁来进攻，谁来防守。然后第二支球队也这样做，根据对手的选择。
        我们将一支球队的防守定义为防守球队的防守技巧。同样，一支球队的攻击力也是进攻队伍的队长的攻击技能。我们假设，如果一支球队的防守严格大于对手的进攻，并且它的进攻严格大于对手的防守，那么它就保证击败另一支球队。
        Q公司的团队了解彼此的优势，因此以最佳方式安排他们的团队。确定保证获胜的团队（如果两个团队都以最佳方式行事）或告诉没有这样的团队。
        Kicker (table football) is a board game based on football, in which players control the footballers' figures mounted on rods by using bars to get the ball into the opponent's goal. When playing two on two, one player of each team controls the goalkeeper and the full-backs (plays defence), the other player controls the half-backs and forwards (plays attack).

         teams of company Q decided to battle each other. Let's enumerate players from both teams by integers from 1 to 4. The first and second player play in the first team, the third and the fourth one play in the second team. For each of the four players we know their game skills in defence and attack. The defence skill of the i-th player is ai, the attack skill is bi.
        Before the game, the teams determine how they will play. First the players of the first team decide who will play in the attack, and who will play in the defence.         Then the second team players do the same, based on the choice of their opponents.
        We will define a team's defence as the defence skill of player of the team who plays defence. Similarly, a team's attack is the attack skill of the player of the team who plays attack. We assume that one team is guaranteed to beat the other one, if its defence is strictly greater than the opponent's attack and its attack is strictly greater than the opponent's defence.
        The teams of company Q know each other's strengths and therefore arrange their teams optimally. Identify the team that is guaranteed to win (if both teams act optimally) or tell that there is no such team.
Input
The input contain the players' description in four lines. The i-th line contains two space-separated integers ai and bi (1≤ai,bi≤100) − the defence and the attack skill of the i-th player, correspondingly.
Output
If the first team can win, print phrase "Team 1" (without the quotes), if the second team can win, print phrase "Team 2" (without the quotes). If no of the teams can definitely win, print "Draw" (without the quotes).
Examples
Input 
1 100
100 1
99 99
99 99
Output 
Team 1
Input 
1 1
2 2
3 3
2 2
Output 
Team 2
Input 
3 3
2 2
1 1
2 2
Output 
Draw
Note
Let consider the first test sample. The first team can definitely win if it will choose the following arrangement: the first player plays attack, the second player plays defence.
Consider the second sample. The order of the choosing roles for players makes sense in this sample. As the members of the first team choose first, the members of the second team can beat them (because they know the exact defence value and attack value of the first team).

输入格式

输入玩家的描述包含四行。第 i 行包含两个空格分隔的整数一个ai和bi （1≤ai，bi≤100）− 第I个玩家的防御和攻击技巧，相应地。

输出格式

如果第一队可以获胜，请打印短语“Team 1”（不带引号），如果第二队可以获胜，则打印短语“Team 2”（不带引号）。如果没有球队绝对可以获胜，请打印“Draw”（不带引号）。

Input

1 100

100 1

99 99

99 99

Output

Team 1

Input

1 1

2 2

3 3

2 2

Output

Team 2

Input

3 3

2 2

1 1

2 2

Output

Draw

 

注意：

让我们考虑第一个测试样本。如果选择以下安排，第一支球队绝对可以获胜：第一个球队打进攻，第二个球队打防守。
考虑第二个示例。在此示例中，玩家的选择角色的顺序是有意义的。当第一队的成员首先选择时，第二队的成员可以击败他们（因为他们知道第一队的确切防御值和攻击值）。

输入样例 复制 

1 100

100 1

99 99

99 99

输出样例 复制 

Team 1

分类标签