Xiao K and Xiao S are playing Go.

The game Xiao K and Xiao S are playing is not exactly Go.

It is somewhat like Go: one side plays black and the other plays white, taking turns placing stones on the board, with the black side going first. If a group of connected stones has no "liberties," they are captured. These captured stones are then placed into the capturer's own stone box lid. Specifically, if Xiao K, who is playing black, captures two white stones of Xiao S, he must place these two white stones into his own stone box lid.

Because the Garlic Association's game room has excellent logistics, we can assume that both players have an infinite supply of stones to play with. However, even excellent logistics can have oversights; both players have exactly one stone box lid, and the size of the lid is limited. Xiao K and Xiao S, who are experts in 3D close-packing, have calculated that a stone box lid can hold at most $M$ stones.

Based on this, Xiao K and Xiao S have developed a brand-new way to play. Unlike traditional Chinese Go, which emphasizes both offense and defense, their current strategy is to frantically sacrifice stones to fill up the opponent's stone box lid. Xiao Z, who is watching the game, finds it very interesting and has recorded every move they made.

According to Xiao Z's records, the two players made a total of $n$ moves, where the $i$-th move resulted in the capture of $a_i$ stones. We consider the player who cannot fit the stones they just captured into their own box lid to have lost the game (at this point, the number of stones the lid needs to hold should be strictly greater than $M$). If the overflow of the stone box lid does not occur throughout the entire game, it is considered a draw.

Now you need to determine who won the game based on Xiao Z's records.

Xiao K and Xiao S are both very sportsmanlike, so they do not necessarily end the game immediately after someone's stone box lid is filled to the point of overflowing.

At the same time, because this is not a proper game of Go, there might be an unusually large number of stones on the board, and stones can even be captured at the very beginning of the game.

Input

Read the data from standard input.

The first line contains two integers $n$ ($1 \le n \le 10^5$) and $M$ ($1 \le M \le 10^9$), representing the total number of moves in the game and the number of stones a stone box lid can hold.

The following $n$ lines each contain an integer $a_i$ ($0 \le a_i \le 10^9$), representing the number of stones captured in the $i$-th move.

Output

Output to standard output.

Output a single string representing the answer.

If the black side wins, output Black. If the white side wins, output White. If the game ends in a draw, output Draw.

Examples

Input 1

4 2
1
2
2
1

Output 1

White

Note 1

The stone box lid can hold 2 stones. First, the black side plays and captures 1 stone; at this point, the black side's stone box lid contains 1 stone. Second, the white side plays and captures 2 stones; at this point, the white side's stone box lid contains 2 stones. Third, the black side plays and captures 2 stones; the stone box lid cannot hold them. Therefore, the white side wins.