#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
#include <cctype>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <utility>
#include <fstream>

using namespace std;
typedef long long ll;
using ull = unsigned long long;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//template<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); }return a; }
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
//constexpr long long mod = 1000000007LL;
constexpr long long  mod = 998244353;

int main()
{

	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	int m, k; cin >> m >> k;
	
	int s = (m - 1) / (k + 1);
	int f = (m - 1) - s;
	
	int cnt = (f + 1) / 2;
	int of = f % 2;
	cnt += (s + of) / 2;
	if (cnt * 2 == m - 1 and s > 0) cout << "Lose" << "\n";
	else if (cnt * 2 == m - 1) cout << "Draw" << "\n";
	else if (cnt * 2 > m - 1) cout << "Win" << "\n";
	else cout << "Lose" << "\n";

}