#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
//typedef long long ll;
//typedef long double ld;
//typedef unsigned long long ull;
//typedef unsigned long double uld;
typedef pair<int,int> P;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};
template<class T> inline bool chmax(T &a,T& b){if(a < b){a = b; return true;} else return false;}
template<class T> inline bool chmin(T &a,T& b){if(a > b){a = b; return true;} else return false;}
//struct area

//function area

//main area
int main(){
    int me, you;
    cin >> me >> you;
    if(me == you){
        cout << "Drew" << endl;
    }
    else if(you - me == 1 || (me == 2 && you == 0)){
        cout << "Won" << endl;
    }
    else{
        cout << "Lost" << endl;
    }
}
/*

me == you  >  Drew
0 1 Win
0 2 Lose
1 0 Lose
1 2 Win
2 0 Win
2 1 Lose

*/