#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

ll modulo(ll a, int m) {
    a %= m; a += m; a %= m;
    return a;
}

int main() {
    int N, K;
    cin >> N >> K;

    int a = modulo(N - K, 3);
    if (a == 0) {
        cout << "Drew" << endl;
    } else if (a == 1) {
        cout << "Lost" << endl;
    } else {
        cout << "Won" << endl;
    }
}