#include <bits/stdc++.h>
using namespace std;
const int N = 21004, M = 204;
vector<int> g[N];
int h, t, r, p = 0, n, m;
int a[M][M], xh[M], xt[M], yh[M], yt[M];
int bg, ed;
int in[N], d[N];
int bfs() {
  memset(d, -1, sizeof(d));
  d[bg] = 0;
  queue<int> q;
  q.push(bg);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int v : g[u]) {
      if (d[v] == -1) {
        d[v] = d[u] + 1;
        q.push(v);
      }
    }
  }
  return d[ed];
}
bool dfs(int u) {
  d[u] = 1;
  for (int v : g[u]) {
    if (d[v] == 0) {
      if (dfs(v)) return 1;
    } else if (d[v] == 1)
      return 1;
  }
  d[u] = -1;
  return 0;
}
int topo() {
  memset(d, 0xcf, sizeof(d));
  d[bg] = 0;
  queue<int> q;
  for (int i = 0; i <= p; i++)
    if (in[i] == 0) q.push(i);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int v : g[u]) {
      d[v] = max(d[v], d[u] + 1);
      if (--in[v] == 0) q.push(v);
    }
  }
  return d[p];
}
int main() {
  scanf("%d %d %d", &h, &t, &r);
  for (int i = 0; i <= r; i++)
    for (int j = 0; j <= r - i; j++) {
      a[i][j] = p++;
    }
  bg = a[h][t];
  ed = a[0][0];
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d %d", &xh[i], &xt[i]);
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) scanf("%d %d", &yh[i], &yt[i]);
  for (int i = 0; i <= r; i++)
    for (int j = 0; j <= r - i; j++) {
      for (int u = 1; u <= n && u <= i; u++) {
        int nh = i - u + xh[u], nt = j + xt[u];
        if (nh + nt > r)
          g[a[i][j]].push_back(p);
        else
          g[a[i][j]].push_back(a[nh][nt]);
      }
      for (int v = 1; v <= m && v <= j; v++) {
        int nh = i + yh[v], nt = j - v + yt[v];
        if (nh + nt > r)
          g[a[i][j]].push_back(p);
        else
          g[a[i][j]].push_back(a[nh][nt]);
      }
    }
  for (int i = 0; i < p; i++)
    for (int x : g[i]) ++in[x];
  int w = bfs();
  if (w != -1) return printf("Ivan\n%d\n", w), 0;
  memset(d, 0, sizeof(d));
  if (dfs(bg))
    puts("Draw");
  else {
    w = topo();
    printf("Zmey\n%d\n", w);
  }
}
