The game in dots

Chip and Dale, resting from their adventures, decided to play such game. Each of them will draw $n$ dots on infinite plane (Chip will use blue color and Dale will use red one). After that Gadget Hackwrench put more $m$ dots with closed eyes. After that for each dot our heroes are counting to who's dot it is closer. If the distance is the same, they erase the dot which was made by Gadget Hackwrench. Otherwise, they change the color of the dot to blue, if a dot of Chip is closer to this dot than all dots of Dale. Otherwise they change the color to red if the dots of Dale are closer.

When all the dots are changed in color or erased, they count the number of dots each has. And find out who has more. Help them to count quickly, and find out who won.

Lets notice, while there is a change of color of all the dots, which were painted by Gadget Hackwrench, these painted dots don't count as Chip or Dale dots.

Input

In the first line two positive integers: $n$ (1 \le n \le 5 \cdot 10^4) -- number of dots for each of our heroes, and $m$ (1 \le m \le 10^5) -- number of dots, which was painted by Gadget Hackwrench. In next $n$ lines will be given Chip's dots, in next $n$ lines Deil's dots and in next $m$ lines - Gadget Hackwrench's dots. All dots are given by two integers $x$, $y$ (-10^7 \le x, y \le 10^7). All dots are different.

Output

If the number of Chip's dots is greater -- output "Chip", otherwise if numbers of Deil's dots is greater -- "Deil", if game will finish by equal score -- output "Draw" (all data output without quotes)