#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { int n, k; cin >> n >> k; if(n == 0 && k == 0) cout << "Drew" << endl; if(n == 0 && k == 1) cout << "Won" << endl; if(n == 0 && k == 2) cout << "Lost" << endl; if(n == 1 && k == 0) cout << "Lost" << endl; if(n == 1 && k == 1) cout << "Drew" << endl; if(n == 1 && k == 2) cout << "Won" << endl; if(n == 2 && k == 0) cout << "Won" << endl; if(n == 2 && k == 1) cout << "Lost" << endl; if(n == 2 && k == 2) cout << "Drew" << endl; return 0; }