#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

const long long INF = 1e6+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);

using namespace std;

int main(){
	
	int n,k;
	cin >> n >> k;
	if(n==k){
		cout << "Drew" << endl;
		return 0;
	}else if(n-k==2){
		cout << "Won" << endl;
		return 0;
	}else if(n-k==-2){
		cout << "Lost" << endl;
		return 0;
	}else if(n-k<0){
		cout << "Won" << endl;
		return 0;
	}else{
		cout << "Lost" << endl;
		return 0;
	}
	
	return 0;
}