#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <cstdlib>
#include <queue>

using namespace std;

typedef long long int ll;
typedef pair<int, int> Pii;

const ll mod = 1000000007;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int x, n, m;
  cin >> x >> n >> m;
  vector<int> a(n), b(m);
  for (auto &y: a) cin >> y;
  for (auto &y: b) cin >> y;

  bool mrmax = false;
  bool maxvalu = false;
  for (auto &y: a) {
    if (y == x) {
      mrmax = true;
      break;
    }
  }
  for (auto &y: b) {
    if (y == x) {
      maxvalu = true;
      break;
    }
  }

  if (mrmax && maxvalu) cout << "MrMaxValu" << endl;
  else if (mrmax) cout << "MrMax" << endl;
  else if (maxvalu) cout << "MaxValu" << endl;
  else cout << -1 << endl;

  return 0;
}