#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <map>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;

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