Welcome to ZOJ
Select Problem
ZOJ Problem Set - 3974
Cake Cutting Game

Time Limit: 2 Seconds      Memory Limit: 65536 KB

Owen and Kevin are playing a cake cutting game at a birthday party. In the beginning of the game, they are given n slices of cakes where each slice i (for i = 1, 2, ..., n) is a circular sector of a central angle equal to bi degree. Each player can only choose one slice, and cut through a radius of the slice, such that each new slice, which is still a sector, must have a central angle greater than or equal to w degree. The two players take turns to cut, until one of them cannot cut any slice and lose the game, while the other wins the game. See Figure 4 for an example.

Figure 4. An illustrative example, where n = 2, w = 30, b1 = 90, b2 = 60, and Owen wins the game.

Suppose that Owen is always the first one to cut, and that both the two players are super smart, and want to win the game. Your task is to decide who will win the game.


The first line of the input contains the number of test cases T.

For each test case, its first line of the input has two integers, n and w, where 1 ≤ n ≤ 100000, 1 ≤ w ≤ 90. The second line of the input has n integers, b1, b2, ..., bn, where wbi ≤ 180 for i = 1, 2, ..., n.


For each test case, output the name of the player ("Owen" or "Kevin") who will win the game.

Sample Input

2 30
90 60

Sample Output


Source: ACM Collegiate Programming Contest 2017 (Hong Kong)
Submit    Status