#include <vector>
#include <map>
#include <climits>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <bitset>
#include <cstring>
#include <list>
#include <iterator>

using namespace std;
using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>; using VVI = vector<VI>; using VS = vector<string>;
using PII = pair<int, int>; using VPII = vector<pair<int, int>>;
template <typename T = int> using VT = vector<T>;
template <typename T = int> using VVT = VT<VT<T>>;
template <typename T = int> using LIM = numeric_limits<T>;

template <typename T> inline T fromString(const string &s) {T res; istringstream iss( s ); iss >> res; return res;};
template <typename T> inline string toString(const T &a) {ostringstream oss; oss << a; return oss.str();};

#define REP(i, x, n) for(int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(e, c) for (auto &e : c )
#define all(x) (x).begin(), (x).end()
#define mp(a, b) make_pair(a, b)
#define INF (1L << 30)
#define fst first
#define snd second
#define DUMP(x) cerr << #x << " = " << (x) << endl

const int dy[] = { 1, 0, -1, 0 };
const int dx[] = { 0, 1, 0, -1 };

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int n, k;
	cin >> n >> k;
	int state = -1;
	if (n == k) {
		state = 0;
	} else {
		if (n == 0 and k == 1) state = 1;
		if (n == 1 and k == 2) state = 1;
		if (n == 2 and k == 0) state = 1;
	}

	cout << ((state == 1) ? "Won" : (state == 0 ? "Drew" : "Lost")) << endl;
	return 0;
}