#include <bits/stdc++.h>
using namespace std;
const int inf = 2000 * 1000 * 1000;
const long long linf = 2000000000000000000LL;
const double eps = 1e-9;
void prepare() {}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long a, b;
bool solve() {
  cin >> a >> b;
  long long la, lb;
  bool ok = false;
  if (a > b) {
    ok = true;
    swap(a, b);
  }
  la = 0;
  lb = b;
  long long t = lcm(a, b);
  long long a1 = 0;
  long long a2 = 0;
  while (la < t) {
    if (la + a < lb) {
      a1 += min(t - la, min(la + a - (lb - b), a));
      la += a;
    } else {
      a2 += min(t - la, lb - la);
      lb += b;
    }
  }
  if (ok) swap(a1, a2);
  if (a1 == a2)
    printf("Equal\n");
  else if (a1 > a2)
    printf("Dasha\n");
  else
    printf("Masha\n");
  return false;
}
int main() {
  prepare();
  while (solve())
    ;
  return 0;
}
