#include <bits/stdc++.h>
int gcd(int a, int b) {
  int t = a % b;
  while (t) {
    a = b;
    b = t;
    t = a % b;
  }
  return b;
}
int main() {
  long long m, n, cnt1, cnt2, res, i, j;
  while (scanf("%I64d%I64d", &m, &n) != EOF) {
    res = m / gcd(m, n) * n;
    cnt1 = 0;
    cnt2 = 0;
    for (i = 1; i * n < res; i++)
      ;
    for (j = 1; j * m < res; j++)
      ;
    cnt2 = i;
    cnt1 = j;
    if (cnt1 - cnt2 > 1)
      printf("Dasha\n");
    else if (cnt2 - cnt1 > 1)
      printf("Masha\n");
    else
      printf("Equal\n");
  }
  return 0;
}
