import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  debug {
    enum N = 10;
    auto dp = new int[][](N, N);
    foreach (i; 0 .. N) foreach (j; 0 .. N) {
      dp[i][j] = -N;
      if (i == 0 && j == 0) dp[i][j] = 0;
      if (i > 0) chmax(dp[i][j], +1 - dp[i - 1][j]);
      if (j > 0) chmax(dp[i][j], -1 + dp[i][j - 1]);
    }
    debug {
      foreach (i; 0 .. N) {
        writeln(dp[i]);
      }
    }
  }
  
  try {
    for (; ; ) {
      const M = readLong();
      const K = readLong();
      
      const bad = M / (K + 1);
      const good = M - 1 - bad;
      long ans;
      if (good % 2 == 0) {
        ans = 0 - bad;
      } else {
        ans = 1 + bad;
      }
      writeln((ans > 0) ? "Win" : (ans < 0) ? "Lose" : "Draw");
    }
  } catch (EOFException e) {
  }
}