#include <bits/stdc++.h>
using namespace std;
int n, m, x, y, s[300100];
pair<long long, long long> a[300100], v[300100];
long long xm, ym;
long long det(int i, int j, int k) {
  long long D;
  D = v[i].first * v[j].second + v[j].first * v[k].second +
      v[i].second * v[k].first - v[i].second * v[j].first -
      v[j].second * v[k].first - v[i].first * v[k].second;
  return D;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m;
  cin >> x >> y;
  long long xm = 0, ym = 0;
  for (int i = 0; i < n; ++i) {
    cin >> a[i].second >> a[i].first;
    xm = max(xm, a[i].second);
    ym = max(ym, a[i].first);
  }
  for (int i = 0; i < m; ++i) {
    cin >> v[i].first >> v[i].second;
  }
  sort(a, a + n);
  sort(v, v + m);
  for (int i = m; i < n + m; ++i) {
    v[i] = a[i - m];
    swap(v[i].first, v[i].second);
  }
  for (int i = 0; i < n; ++i) {
    swap(a[i].first, a[i].second);
  }
  int k = 0;
  s[++k] = 0;
  if (m > 1) s[++k] = 1;
  for (int i = 2; i < m; ++i) {
    if (det(s[k - 1], s[k], i) < 0) {
      s[++k] = i;
    } else {
      while (det(s[k - 1], s[k], i) >= 0 && k > 1) {
        s[k] = 0;
        k--;
      }
      s[++k] = i;
    }
  }
  int p = 0;
  while (p + 1 <= k && v[s[p]].second <= v[s[p + 1]].second) ++p;
  int r = n - 1;
  int K = 1;
  for (int i = 0; i < m; ++i) {
    if (v[i].first > xm) K = 0;
  }
  if (K) {
    cout << "Max";
    return 0;
  }
  K = 1;
  for (int i = 0; i < m; ++i) {
    if (v[i].second > ym) K = 0;
  }
  if (K) {
    cout << "Max";
    return 0;
  }
  for (; p < k; ++p) {
    if (r < 0 || a[r].second < v[s[p + 1]].second) continue;
    if (det(s[p], s[p + 1], m + r) >= 0) {
      cout << "Max";
      return 0;
    }
    r--;
    p--;
  }
  cout << "Min";
  return 0;
}
