401465: GYM100460 K Epilogue

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

K. Epiloguetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

Running away from Enia, Deimos left in the chambers of the palace his book «Introduction to Spells» written by some Xentaronian sorcerer called Samoht Nemroc. Desmond and Thorwald had read this book but hadn't understood nothing. But in the end of the book they found the list of most popular laugh-making spells and now each day they play a game «You laugh, you lose»: they read spells from the list, one spell after another, simultaneously, until one of them laughs. Who laughs first, loses the game.

There are total of n spells in the list, each of which is characterized by its influence to Desmond ai and influence to Thorwald bi. The friends play m days in a row. Each day they play one game, starting the list from the very beginning. At the j-th day seriousness of Desmond takes the value dj and seriousness of Thourwald takes the value tj. The hero laughs if and only if the influence of the current spell being read to him exceeds his seriousness.

For each day you have to determine the outcome of the game and to be glad of the good end of our story. Cause now the heroes can rejoice as much as they want, because evil dark magician Deimos will never return to Enia...   OR WILL HE?

Input

The first line contains the single integer n (1 ≤ n ≤ 105) — the number of spells in the book. The second line contains n integers separated by the spaces: ai (0 ≤ ai ≤ 109) — the influence of the i-th spell to Desmond. The third line analogically contains n integers separated by the spaces: bi (0 ≤ bi ≤ 109) — the influence of the i-th spell to Thorwald.

The fourth line contains a single integer m (1 ≤ m ≤ 105) — the number of days the game continued. The fifth line contains m integers separated by the spaces: dj (0 ≤ dj ≤ 109) — the seriousness of Desmond at the j-th day. The sixth line analogically contains m integers separated by the spaces: tj (0 ≤ tj ≤ 109) — the seriousness of Thorwald at the j-th day.

Output

Output m lines. In the j-th line output «Constantine» (without quotes) if at the j-th day Desmond wins, «Mike» (without quotes) if at the j-th day the winner is Thorwald, or «Draw» if the heroes at that day laugh simultaneously or don't laugh at all.

ExamplesInput
4
1 2 3 4
3 2 1 5
3
1 2 4
3 2 5
Output
Mike
Constantine
Draw
Input
10
1 2 4 8 16 32 64 128 256 512
100 200 300 400 500 600 700 800 900 1000
5
4 15 63 146 555
7 30 111 322 800
Output
Constantine
Constantine
Constantine
Constantine
Constantine

加入题单

算法标签: