Vasya the programmer lives in the middle of the Programming subway branch. He has two girlfriends: Dasha and Masha, who live at the different ends of the branch, each one is unaware of the other one's existence.

When Vasya has some free time, he goes to one of his girlfriends. He descends into the subway at some time, waits the first train to come and rides on it to the end of the branch to the corresponding girl. However, the trains run with different frequencies: a train goes to Dasha's direction every *a* minutes, but a train goes to Masha's direction every *b* minutes. If two trains approach at the same time, Vasya goes toward the direction with the lower frequency of going trains, that is, to the girl, to whose directions the trains go less frequently (see the note to the third sample).

We know that the trains begin to go simultaneously before Vasya appears. That is the train schedule is such that there exists a moment of time when the two trains arrive simultaneously.

Help Vasya count to which girlfriend he will go more often.
The first line contains two integers *a* and *b* (*a* ≠ *b*, 1 ≤ *a*, *b* ≤ 10<sup class="upper-index">6</sup>).
Let's take a look at the third sample. Let the trains start to go at the zero moment of time. It is clear that the moments of the trains' arrival will be periodic with period 6. That's why it is enough to show that if Vasya descends to the subway at a moment of time inside the interval (0, 6], he will go to both girls equally often. 

If he descends to the subway at a moment of time from 0 to 2, he leaves for Dasha on the train that arrives by the second minute.

If he descends to the subway at a moment of time from 2 to 3, he leaves for Masha on the train that arrives by the third minute.

If he descends to the subway at a moment of time from 3 to 4, he leaves for Dasha on the train that arrives by the fourth minute.

If he descends to the subway at a moment of time from 4 to 6, he waits for both trains to arrive by the sixth minute and goes to Masha as trains go less often in Masha's direction.

In sum Masha and Dasha get equal time — three minutes for each one, thus, Vasya will go to both girlfriends equally often.
3 7
Dasha
5 3
Masha
2 3
Equal
31 88
Dasha
8 75
Dasha
32 99
Dasha
77 4
Masha
27 1
Masha
84 11
Masha
4 6
Equal
52 53
Equal
397 568
Dasha
22 332
Dasha
419 430
Dasha
638 619
Masha
393 325
Masha
876 218
Masha
552 551
Equal
906 912
Equal
999 996
Equal
652 653
Equal
3647 7698
Dasha
2661 8975
Dasha
251 9731
Dasha
9886 8671
Masha
8545 7312
Masha
4982 2927
Masha
7660 7658
Equal
9846 9844
Equal
9632 9640
Equal
5036 5037
Equal
64854 77725
Dasha
4965 85708
Dasha
20393 86640
Dasha
99207 30728
Masha
77545 13842
Masha
30362 10712
Masha
51291 51292
Equal
55381 55382
Equal
91560 91550
Equal
99087 99090
Equal
983794 986389
Dasha
779183 786727
Dasha
450766 610961
Dasha
664690 630787
Masha
461363 256765
Masha
638067 409048
Masha
929061 929052
Equal
996219 996216
Equal
716249 716248
Equal
782250 782252
Equal
1 2
Equal
2 1
Equal
999999 1000000
Equal
999997 1000000
Dasha
1000000 999993
Masha
999983 999979
Masha
import math
a,b=map(int, input().split())
d=0
m=0
lcm=a*b//math.gcd(a,b)
for i in range(1,lcm+1):
    #print(i)
    if i%a==0 and i%b!=0:
        d+=1
        print(i,'d')
    elif i%b==0 and i%a!=0:
        m+=1
        print(i,'m')
    elif i%a==0 and i%b==0:
        if a<b:
            m+=1
            #print(i,'m')
        else:
            d+=1
            #print(i,'d')


if d>m:
    print('Dasha')
elif m>d:
    print('Masha')
else:
    print('Equal')
#print(m,d)
