#include <bits/stdc++.h>
inline long long max(const long long &a, const long long &b) {
  return a > b ? a : b;
}
static const long long N = 100005;
long long st[N << 1];
std ::vector<long long> rec;
struct Point {
  long long type, x, y;
  Point(const long long &_x = 0, const long long &_y = 0)
      : type(0), x(_x), y(_y) {}
  bool operator==(const Point &p) const {
    return type == p.type && x == p.x && y == p.y;
  }
  bool operator<(const Point &p) const { return x == p.x ? y < p.y : x < p.x; }
  Point operator-(const Point &p) const { return Point(x - p.x, y - p.y); }
  long long operator*(const Point &p) const { return x * p.y - y * p.x; }
} p[N << 1];
signed main() {
  long long n, m, tot, mxa = 0, mxb = 0;
  scanf("%lld%lld%*d%*d", &n, &m), tot = n + m + 3;
  for (long long i = 0; i < n; ++i)
    scanf("%lld%lld", &p[i].x, &p[i].y), p[i].type = 1;
  for (long long i = n; i < n + m; ++i)
    scanf("%lld%lld", &p[i].x, &p[i].y), p[i].type = 2, mxa = max(mxa, p[i].x),
                                         mxb = max(mxb, p[i].y);
  p[n + m] = Point(0, 0), p[n + m + 1] = Point(mxa, 0),
        p[n + m + 2] = Point(0, mxb), std ::sort(p, p + tot);
  for (long long i = 0, j; i < tot; i = j) {
    j = i;
    long long rec = 0;
    while (j < tot && p[i].x == p[j].x && p[i].y == p[j].y) ++j;
    for (long long k = i; k < j; ++k) rec |= p[k].type;
    if (rec & 1)
      for (long long k = i; k < j; ++k) p[k].type = 1;
  }
  tot = std ::unique(p, p + tot) - p;
  long long sz = 0;
  for (long long i = 0; i < tot; ++i) {
    while (sz > 1 &&
           (p[st[sz - 1]] - p[st[sz - 2]]) * (p[i] - p[st[sz - 1]]) < 0)
      --sz;
    st[sz++] = i;
  }
  for (long long i = 0; i < sz; ++i) rec.push_back(st[i]);
  sz = 0;
  for (long long i = tot - 1; ~i; --i) {
    while (sz > 1 &&
           (p[st[sz - 1]] - p[st[sz - 2]]) * (p[i] - p[st[sz - 1]]) < 0)
      --sz;
    st[sz++] = i;
  }
  for (long long i = 1; i < sz - 1; ++i) rec.push_back(st[i]);
  for (long long i = rec.size() - 1; ~i; --i)
    if (p[rec[i]].type == 1) return printf("Max\n"), 0;
  return printf("Min\n"), 0;
}
