CF1354G Find a Gift

This is an interactive problem. Don't forget to flush output after printing queries using cout.flush() or fflush(stdout) in C++ or similar functions in other programming languages. There are $ n $ gift boxes in a row, numbered from $ 1 $ to $ n $ from left to right. It's known that exactly $ k $ of them contain valuable gifts — other boxes contain just lucky stones. All boxes look the same and differ only in weight. All boxes with stones have the same weight and are strictly heavier than boxes with valuable items. But valuable gifts may be different, so the boxes with valuable items may have different weights. You can ask no more than $ 50 $ queries (printing an answer doesn't count). By each query you can compare total weights of two non-intersecting subsets of boxes $ a_1, a_2, \dots, a_{k_a} $ and $ b_1, b_2, \dots, b_{k_b} $ . In return you'll get one of four results: - FIRST, if subset $ a_1, a_2, \dots, a_{k_a} $ is strictly heavier; - SECOND, if subset $ b_1, b_2, \dots, b_{k_b} $ is strictly heavier; - EQUAL, if subsets have equal total weights; - WASTED, if the query is incorrect or the limit of queries is exceeded. Using such queries (or, maybe, intuition) find the box with a valuable gift with the minimum index.

N/A

N/A

Additional separators "–" in the sample are used only to increase the readability of the sample. Don't print any unnecessary symbols or line breaks in your solution when you send it to the system. Hacks are forbidden in this task.