B. Choosing Cubes

Dmitry has 𝑛 cubes, numbered from left to right from 1 to 𝑛. The cube with index 𝑓 is his favorite.

Dmitry threw all the cubes on the table, and the 𝑖-th cube showed the value 𝑎𝑖 (1≤𝑎𝑖≤100). After that, he arranged the cubes in non-increasing order of their values, from largest to smallest. If two cubes show the same value, they can go in any order.

After sorting, Dmitry removed the first 𝑘 cubes. Then he became interested in whether he removed his favorite cube (note that its position could have changed after sorting).

For example, if 𝑛=5, 𝑓=2, 𝑎=[4,3,3,2,3] (the favorite cube is highlighted in green), and 𝑘=2, the following could have happened:

• After sorting 𝑎=[4,3,3,3,2], since the favorite cube ended up in the second position, it will be removed.
• After sorting 𝑎=[4,3,3,3,2], since the favorite cube ended up in the third position, it will not be removed.