#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    ll m, k;
    cin>>m>>k;
    ll x=(m-1)/(k+1), y=m-1-x;
    ll c=0;
    if(y%2==0){
        c=y/2;
    }else{
        c=x+(y+1)/2;
    }
    if(2*c<m-1) cout<<"Lose"<<endl;
    else if(2*c==m-1) cout<<"Draw"<<endl;
    else cout<<"Win"<<endl;
    /*ll dp[101][101]={};
    for(int i=0; i<100; i++){
        for(int j=0; j<100; j++){
            if(i){
                dp[i][j]=max(dp[i][j], dp[i-1][j]);
            }
            if(j){
                dp[i][j]=max(dp[i][j], i+j-1-dp[i][j-1]+1);
            }
        }
    }
    for(int i=0; i<10; i++){
        for(int j=0; j<10; j++){
            cout<<dp[i][j]<<" ";
        }
        cout<<endl;
    }*/
    return 0;
}