#include <bits/stdc++.h>   using namespace std;   long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }   long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }   int main() {     long long a, b;     while (cin >> a >> b) {       long long suma = 0, sumb = 0;       long long ca = 0, cb = 0;       long long limit = lcm(a, b);       long long now = 0, prev = 0;       while (now <= limit) {         if (now % b != 0 || (now % a == 0 && a > b)) {           suma += now - prev;         } else {           sumb += now - prev;         }         prev = now;         now = min(a * (ca + 1), b * (cb + 1));         if (now % a == 0) ca++;         if (now % b == 0) cb++;       }       cout << (suma == sumb ?  Equal  : suma > sumb ?  Dasha  :  Masha ) << endl;     }     return 0;   }   