#include <iostream>
#include <fstream>
#include <list>
#include <stack>
#include <deque>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <iomanip>
#include <ctime>
#include <iterator>
#include <cstdio>
#include <cstring>
#include <cstdlib>


using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

#define f first
#define s second
#define pb push_back
#define mp make_pair

const int maxn = 100500;
const int inf = 2e9;
const double eps = 1e-8;
const int base = 1073676287;

string ans1;
string ans2;

void solve() {
	ans1 = "Miron";
	ans2 = "Slava";
	ll n, x1, y1, x2, y2;
	cin >> n >> x1 >> y1 >> x2 >> y2;
	if ( y1 == y2 ) {
		cout << "Draw" << endl;
		return;
	}
	if ( x1 == x2 ) {
		if ( y1 > y2 ) {
			y1 = n + 1 - y1;
			y2 = n + 1 - y2;
		}
		ll pos = ( y1 + y2 ) / 2;
		if ( pos == n - pos ) {
			cout << "Draw" << endl;
			return;
		}
		if ( pos > n - pos )
			cout << ans1 << endl;
		else
			cout << ans2 << endl;
		return;
	}


	if ( abs( y1 - y2 ) == 1 ) {
		if ( y1 > y2 ) {
			y1 = n + 1 - y1;
			y2 = n + 1 - y2;
		}
		if ( y1 > n - y1 )
			cout << ans1 << endl;
		else
			cout << "Draw" << endl;
		return;
	}

	if ( y1 > y2 ) {
		y1 = n + 1 - y1;
		y2 = n + 1 - y2;
	}
	ll toGo = y2 - y1 - 2LL;
	y1 += ( toGo + 1 ) / 2;
	y2 -= toGo / 2;

	if ( y1 > n - y1) {
		cout << ans1 << endl;
		return;
	}
	if ( y1 + 1 < n - y1 - 1 ) {
		cout << ans2 << endl;
		return;
	}
	cout << "Draw" << endl;
	// puts( "hui" );
}

int main()
{
    srand( time( 0 ) );
    // freopen( "input.txt", "r", stdin );
    // freopen( "output.txt", "w", stdout );
    ios_base::sync_with_stdio(false);
    int q;
    cin >> q;
    while ( q-- ) 
    	solve();
    return 0;
}