#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int m, k;
    cin >> m >> k;
    int a = (m-1)/(k+1), b = m-1-a;
    int win = (b+1)/2, lose = b-win;
    (b%2 == 0 ? lose : win) += a;
    if(win > lose) puts("Win");
    else if(win < lose) puts("Lose");
    else puts("Draw");
    return 0;
}