#include<iostream>
#include<string>
#include<cstring>
#include<complex>
#include<vector>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<iomanip>
using namespace std;

#define REP(i, j) for (int i = 0; i < (int)j; ++i)
#define FOR(i, j, k) for (int i = (int)j; i < (int)k; ++i)
#define SORT(v) sort(v.begin(), v.end())
#define REVERSE(v) reverse(v.begin(), v.end())
typedef complex<double> P;
typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> PII;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n, k;
	cin >> n >> k;
	string w = "Won", l = "Lost", d = "Drew";

	if (n == k) cout << d << endl;
	else if (n == 0) {
		cout << (k == 1 ? w : l) << endl;
	} else if (n == 1) {
		cout << (k == 0 ? l : w) << endl;
	} else if (n == 2) {
		cout << (k == 0 ? w : l) << endl;
	}
	return 0;
}