#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = 1 << 29;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return n & two(b); }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
template <class T>
void chmax(T& a, const T& b) {
  a = max(a, b);
}
template <class T>
void chmin(T& a, const T& b) {
  a = min(a, b);
}
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
long long nsn(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
  long long a, b;
  cin >> a >> b;
  long long N = nsn(a, b);
  long long sum1 = N / a - 1, sum2 = N / b - 1;
  if (a < b)
    sum2++;
  else
    sum1++;
  if (sum1 > sum2)
    cout << "Dasha" << endl;
  else if (sum1 < sum2)
    cout << "Masha" << endl;
  else
    cout << "Equal" << endl;
  return 0;
}
