#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())

int arr[100005];
int cnt[3] = {};

void first() {
    cout << "Zenyk\n";
    exit(0);
}

void second() {
    cout << "Marichka\n";
    exit(0);
}

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

    auto fight = [&]() {
        return cnt[2] & 1;    
    };

    int n, a, b;
    cin >> n >> a >> b;

    auto idx = [&](int m) {
        if (m % (a + b) < min(a, b)) return 0;
        if (m % (a + b) < max(a, b)) return 1;
        return 2;
    };

    for (int i = 1; i <= n; ++i) {
        cin >> arr[i];
        ++cnt[idx(arr[i])];
    }

    if (a <= b) {
        if (fight()) first(); 
        else second();
    }
    else {
        for (int i = 1; i <= n; ++i) {
            if (arr[i] >= a) {
                --cnt[idx(arr[i])];
                arr[i] -= a;
                ++cnt[idx(arr[i])];
                if (!fight()) first();
                --cnt[idx(arr[i])];
                arr[i] += a;
                ++cnt[idx(arr[i])];
            }
        }
        second();
    }
}