Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)

#### Problem Description

Alice and Bob are coming.

This time, they are playing with apples. Initially, there are N baskets and M apples. Both baskets and apples are distinguishable. Each turn, (s)he can choose adding a basket or an apple. Alice always plays first. When (s)he complete operation, if the number of ways to split apples into baskets is not less than A, (s)he lose.

Now Alice wonder whether she can win if both player use best strategy.

#### Input

There are multiple test cases.

Each test case contains three integers N, M and A.

1 <= N <= 10,000

1 <= M <= 30

2 <= A <= 1,000,000,000

#### Output

For each test case, if Alice can win, output "win" and if Bob can win, output "lose"; otherwise output "draw".

#### Sample Input

#### Sample Output

#### Source

dut200901102

#### Manager