#include <bits/stdc++.h>
using namespace std;
int fact[5001];
int invfact[5001];
int inv(int a, int b) {
  if (b == 0) return 1;
  if (b & 1)
    return (long long)a * inv(a, b - 1) % 1000000007;
  else {
    int res = inv(a, b >> 1);
    return (long long)res * res % 1000000007;
  }
}
void init() {
  fact[0] = 1;
  for (int i = 1; i < 5001; i++) {
    fact[i] = (long long)fact[i - 1] * i % 1000000007;
  }
  invfact[5000] = inv(fact[5000], 1000000007 - 2);
  for (int i = 5000; i > 0; i--) {
    invfact[i - 1] = (long long)invfact[i] * i % 1000000007;
  }
}
int C(int n, int r) {
  if (r > n || r < 0) return 0;
  return (long long)((long long)fact[n] * invfact[r] % 1000000007) *
         invfact[n - r] % 1000000007;
}
int gcd(int a, int b) {
  return a > b ? (gcd(b, a)) : (a == 0 ? b : gcd(b % a, a));
}
void solve() {
  int res = 0;
  int a, b;
  scanf("%d", &a);
  scanf("%d", &b);
  int g = gcd(a, b);
  int ra = b / g - 1;
  int rb = a / g - 1;
  a > b ? ++ra : ++rb;
  if (ra > rb)
    printf("Dasha");
  else if (rb > ra)
    printf("Masha");
  else
    printf("Equal");
}
int main() {
  solve();
  return 0;
}
