The game in dots
Chip’ and Dale are having rest from their adventures. And they decided to play such game. Each of them will put N number of dots on infinite plane (Chip will use blue color and Dale will use red one). After that Gadget Hackwrench put more M dots with the close 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. In another way they change the color of the dot to blue, if a dot of Chip is closer to this dot, than all other dots of Dale. Otherwise they change the color to red if the dots of Dale is closer.
When all the dots are changed in color or erase, they count the number of dots of each one. 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 was made by Gadget Hackwrench, this painted points don’t count as Chip or Dale dots.
Input
In first line two positive integers: n (1 ≤ n ≤ 5·10^4) – of dots in our heroes, and m (1 ≤ m ≤ 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 is given by two integets x, y (-10^7 ≤ x, y≤ 10^7). All dots is different.
Output
If numbers 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)