#include <bits/stdc++.h>
using namespace std;
long long getint() {
  long long _x = 0, _tmp = 1;
  char _tc = getchar();
  while ((_tc < '0' || _tc > '9') && _tc != '-') _tc = getchar();
  if (_tc == '-') _tc = getchar(), _tmp = -1;
  while (_tc >= '0' && _tc <= '9') _x *= 10, _x += (_tc - '0'), _tc = getchar();
  return _x * _tmp;
}
long long mypow(long long _a, long long _x, long long _mod) {
  if (_x == 0) return 1ll;
  long long _tmp = mypow(_a, _x / 2, _mod);
  _tmp = (_tmp * _tmp) % _mod;
  if (_x & 1) _tmp = (_tmp * _a) % _mod;
  return _tmp;
}
bool equal(double _x, double _y) { return _x > _y - 1e-9 && _x < _y + 1e-9; }
int __ = 1, cs;
int n, m;
vector<pair<int, int> > v, v0, ch;
set<pair<int, int> > s;
pair<int, int> operator-(const pair<int, int> &p1, const pair<int, int> &p2) {
  return make_pair(p1.first - p2.first, p1.second - p2.second);
}
bool cross(pair<int, int> p1, pair<int, int> p2) {
  return (long long)p1.first * (long long)p2.second -
             (long long)p1.second * (long long)p2.first <
         0ll;
}
void build() {}
void init() {
  n = getint();
  m = getint();
  int _ = getint();
  _ = getint();
  for (int i = 0; i < n; i++) {
    int tx = getint();
    int ty = getint();
    v.push_back(make_pair(tx, -ty));
    v0.push_back(make_pair(tx, ty));
  }
  for (int i = 0; i < m; i++) {
    int tx = getint();
    int ty = getint();
    v.push_back(make_pair(tx, -ty));
  }
  sort(v.begin(), v.end());
  v.resize(unique(v.begin(), v.end()) - v.begin());
}
void solve() {
  int csz = 0;
  for (int i = 0; i < (int)v.size(); i++) {
    v[i].second = -v[i].second;
    while (csz > 0 && ch[csz - 1].second < v[i].second) ch.pop_back(), csz--;
    while (csz > 1 && cross(v[i] - ch[csz - 2], ch[csz - 1] - ch[csz - 2]))
      ch.pop_back(), csz--;
    ch.push_back(v[i]);
    csz++;
  }
  for (int i = 0; i < (int)ch.size(); i++) s.insert(ch[i]);
  bool winner = false;
  for (int i = 0; i < (int)v0.size(); i++)
    if (s.find(v0[i]) != s.end()) {
      winner = true;
      break;
    }
  puts(winner ? "Max" : "Min");
}
int main() {
  build();
  while (__--) {
    init();
    solve();
  }
}
