#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef complex<double> C;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, K;
    cin >> N >> K;
    if (N == K) {
        cout << "Drew" << endl;
        return 0;
    }
    if (N == 0) {
        if (K == 1) cout << "Won" << endl;
        else cout << "Lost" << endl;
    }
    if (N == 1) {
        if (K == 2) cout << "Won" << endl;
        else cout << "Lost" << endl;
    }
    if (N == 2) {
        if (K == 0) cout << "Won" << endl;
        else cout << "Lost" << endl;
    }
    return 0;
}