Epilogue

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (1<<17)
ll A[MX],B[MX],a,b;
int N,Q,U[MX],V[MX];
void pr(ll*A){F(N)scanf("%lld",&a),A[i+1]=max(A[i],a);}
int main(void){
    scanf("%d",&N),pr(A),pr(B);
    scanf("%d",&Q),ga(Q,U),ga(Q,V),++N;
    F(Q){
        a=upper_bound(A,A+N,U[i])-A;
        b=upper_bound(B,B+N,V[i])-B;
        if(a==b)printf("Draw\n");
        else if(a>b)printf("Constantine\n");
        else printf("Mike\n");
    }
    return 0;
}