#include <iostream>
#include <vector>
#include <algorithm>
#define REP(i,n) for(int i=0;i<(n);++i)
#define SORT(a) sort((a).begin(),(a).end())
#define PB push_back
using namespace std;
typedef vector<int> VI;

int main(){
  int N, K;
  cin >> N >> K;
  int r = (N - K + 3) % 3;
  if(r == 0){
    cout << "Drew" << endl;
  }else if(r == 1){
    cout << "Lost" << endl;
  }else if(r == 2){
    cout << "Won" << endl;
  }
}